Advertisement
NAbdulla

Untitled

Nov 16th, 2014
162
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.05 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4.  
  5. int poly_by_Homar(int a[], int n, int x)
  6. {
  7. int k, b;
  8. k = 0;
  9. b = a[k];
  10. while(k < n){
  11. b = a[k+1] + b*x;
  12. k++;
  13. }
  14. return b;
  15. }
  16.  
  17. int main()
  18. {
  19. int i1, i2, j, k, f, d, d1, poly, co[1000], x[1000], t;
  20. char coe[100000], xs[100000], *tok;
  21. while(gets(coe)){
  22. if(strlen(coe) == 0) break;
  23. gets(xs);
  24. d1 = 0;
  25. f = 0;
  26.  
  27. for(i1 = 0; coe[i1] != '\0'; i1++){
  28. if(coe[i1] == ' ')d1++;
  29. }
  30.  
  31. for(tok = strtok(xs, " "), i1 = 0; tok != NULL; tok = strtok(NULL, " ")){
  32. x[i1++] = atoi(tok);
  33. }
  34.  
  35. for(tok = strtok(coe, " "), i2 = 0; tok != NULL; tok = strtok(NULL, " ")){
  36. co[i2++] = atoi(tok);
  37. }
  38.  
  39. for(k = 0; k < i1; k++){
  40. d = d1;
  41. poly = poly_by_Homar(co, d, x[k]);
  42. if(f == 0){
  43. printf("%d", poly);
  44. f = 1;
  45. }
  46. else printf(" %d", poly);
  47. }
  48.  
  49. printf("\n");
  50. }
  51. return 0;
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement