Advertisement
Guest User

Untitled

a guest
May 23rd, 2018
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.70 KB | None | 0 0
  1. #include "stdafx.h"
  2. #include <iostream>
  3. #include <iomanip>
  4.  
  5. using namespace std;
  6.  
  7. long int factorial(int n)
  8. {
  9. if (n == 1 || n == 0) return 1;
  10. else return n* factorial(n - 1);
  11. }
  12.  
  13.  
  14. int main()
  15. {
  16. double l[100];
  17. l[0] = 0; //l[0] = 1
  18. l[1] = 1; //l[1] = 0
  19. l[2] = 0;
  20. l[3] = 1./12.; // l[3] = 0
  21. cout.setf(ios::fixed);
  22. for (int j = 2; j < 100; j++) {
  23. int sum = 0;
  24. for (int k = 1; k <= j; k++) {
  25. sum += ((j - k + 2)*(j - k + 1)*l[j - k + 2]) / factorial(k);
  26. }
  27. l[j + 2] = -(2*sum - j*l[j] + 6 * l[j - 2]) / ((1 + j)*(2 + j));
  28. }
  29. for (int i = 0; i < 100; i++) {
  30. cout << "l[" << i << "]\t" << setprecision(6) << l[i] << endl;
  31. }
  32. cout.unsetf(ios::fixed);
  33. getchar();
  34. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement