Advertisement
Guest User

prvi

a guest
Nov 19th, 2019
95
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.87 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <math.h>
  4.  
  5. double f(double x, int exp)
  6. {
  7. double y=1;
  8. int i=0;
  9. if(exp>0)
  10. {
  11. for(i=0; i<exp; i++)
  12. {
  13. y*=x;
  14. }
  15. return y;
  16. }
  17. else if(exp<0)
  18. {
  19.  
  20. for(i=0; i<exp; i++)
  21. {
  22. y/=x;
  23. }
  24. return y;
  25. }
  26. return 1;
  27.  
  28. }
  29. int main()
  30. {
  31. double a=0, b=0, h=0;
  32. int n=0;
  33. printf("Unesite prvu tacku intervala: ");
  34. scanf("%lf", &a);
  35. printf("Unesite drugu tacku intervala: ");
  36. scanf("%lf", &b);
  37. while((abs(a)+abs(b))>100 || a>=b)
  38. {
  39. printf("\nNeispravan interval!");
  40. printf("\nUnesite prvu tacku intervala: ");
  41. scanf("%lf", &a);
  42. printf("Unesite drugu tacku intervala: ");
  43. scanf("%lf", &b);
  44. }
  45. printf("Unesite eksponent: ");
  46. scanf("%d", &n);
  47. while(!(n>=-1 && n<=10))
  48. {
  49. printf("\nPogresan eksponent!");
  50. printf("\nUnesite eksponent: ");
  51. scanf("%d", &n);
  52. }
  53. printf("Unesite korak diskretizacije: ");
  54. scanf("%lf", &h);
  55. int j=0;
  56. double p=0;
  57. int pom_br=0;
  58. double m=a;
  59. double k=a;
  60. while(m+h<b || fabs(m+h-b)<1e-7)
  61. {
  62. m+=h;
  63. pom_br++;
  64. }
  65. printf("Korak x y = f(x)\n");
  66. for(int i=0; i<34; i++) printf("-");
  67. printf("\n");
  68. while(a+h<b || fabs(a+h-b)<1e-7)
  69. {
  70. j++;
  71. if(j<=4)
  72. {
  73. printf(" %d. %0.5lf %0.5lf\n", j, a, f(a, n));
  74. }
  75. if(j==pom_br)
  76. {
  77. printf("(...)\n");
  78. printf(" %d. %0.5lf %0.5lf\n", j, a, f(a, n));
  79. }
  80. p+=f(a,n)*h;
  81. a+=h;
  82. }
  83. for(int i=0; i<34; i++) printf("-");
  84. printf("\n");
  85. printf("P(x^%d)[%g,%g]= %0.5lf (dx=%g)", n, k, b, p, h);
  86. return 0;
  87. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement