Advertisement
Guest User

Untitled

a guest
Feb 9th, 2016
52
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.07 KB | None | 0 0
  1. void pierwiastek();
  2. {
  3. double p[P] = {0};
  4. double q[P] = {0};
  5.  
  6. int j = 0;
  7. for(int i = 1; i <= abs(wsp[N-1]); i++)
  8. {
  9. if((wsp[N-1]%i) == 0)
  10. {
  11. p[j] = i;
  12. j++;
  13. }
  14. }
  15.  
  16.  
  17. int k = 0;
  18. for(int i = 1; i <= abs(wsp[0]); i++)
  19. {
  20. if((wsp[0]%i) == 0)
  21. {
  22. q[k] = i;
  23. k++;
  24. }
  25. }
  26.  
  27. double t[N][N];
  28.  
  29. for(int i = 0; i < j; i++)
  30. {
  31. for(int r = 0; r < k; r++)
  32. t[i][r] = (double)(p[i]/q[r]);
  33. }
  34.  
  35. for(int i = 0; i < j; i++)
  36. {
  37. for(int r = 0; r < k; r++)
  38. {
  39. if(Horner(t[i][r]) == 0.0)
  40. cout << t[i][r] << " jest pierwiastkiem" << endl;
  41. if(Horner(-t[i][r]) == 0.0)
  42. cout << (-t[i][r]) << " jest pierwiastkiem" << endl;
  43. }
  44. }
  45.  
  46. }
  47.  
  48. double Horner(double x)
  49. {
  50. double w = 0;
  51. int i = 0;
  52.  
  53. for(i; i < N; i++)
  54. w = w*x + wsp[i];
  55.  
  56. return w;
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement