Advertisement
Guest User

Untitled

a guest
Dec 10th, 2016
120
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.54 KB | None | 0 0
  1. #include <stdio.h>
  2. #include<stdlib.h>
  3.  
  4.  
  5. int zbir(int k){
  6. int suma=0;
  7. while(k>0){
  8. suma+=k%10;
  9. k/=10;
  10. }
  11. return suma;
  12. }
  13.  
  14.  
  15. void ubaci(int niz[],int vel){
  16. int *p,*q;
  17. int i=2*vel;
  18. for(i;i>=0;i-=2)
  19. {
  20. p=niz+i;
  21. q=niz+i/2;
  22. *p=*q;
  23. }
  24. int k;
  25. for(i=0;i<2*vel;i+=2)
  26. {
  27. p=niz+i;
  28. q=p+1;
  29. k=abs(*p);
  30. *q=zbir(k);
  31. }
  32.  
  33. }
  34.  
  35. int najveci(int niz[],int vel){
  36. int maxi=niz[0],i=0;
  37. for(i=0;i<vel;i++)
  38. if(maxi<niz[i])
  39. maxi=niz[i];
  40.  
  41. return maxi;
  42. }
  43.  
  44. int izbaci(int niz[],int vel){
  45. int k[1000]={0};
  46. int m,t=2,i,j=0,r,p;
  47. m=najveci(niz,vel);
  48. k[0]=1;
  49. k[1]=1;
  50.  
  51. for(i=2;i<1000;i++)
  52. {
  53. k[i]=k[i-1]+k[i-2];
  54. t++;
  55. if(k[i]>m)
  56. break;
  57. }
  58. t--;
  59. r=vel;
  60. int z;
  61. i=0;
  62. for(i=0;i<r;i++)
  63. {
  64. for(j=1;j<t;j++)
  65. {
  66.  
  67. if(niz[i]==k[j])
  68. {
  69. for(z=i;z<r-1;z++)
  70. niz[z]=niz[z+1];
  71. r--;
  72. i--;
  73. break;
  74. }
  75. }
  76.  
  77.  
  78. }
  79. return r;
  80.  
  81.  
  82. }
  83.  
  84.  
  85. int main() {
  86. int a[20],i,w,vel=10;
  87. printf("Unesite niz od 10 brojeva: ");
  88. for(i=0;i<10;i++)
  89. scanf("%d",&a[i]);
  90. ubaci(a,vel);
  91. vel*=2;
  92. w=izbaci(a,vel);
  93. printf("Modificirani niz glasi: ");
  94. for(i=0;i<w-1;i++)
  95. {
  96. printf("%d, ",a[i]);
  97. }
  98. printf("%d. ",a[i]);
  99. return 0;
  100. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement