Advertisement
catalyn

problema 24 11 2015 a 2-a de la div

Nov 24th, 2015
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.75 KB | None | 0 0
  1. //se citeste un vector sa se verifice daca toate elem vectorului sunt nr prime afisand da sau nu
  2. #include <iostream>
  3.  
  4. using namespace std;
  5. int v[100],n;
  6. int nrprim(int x)
  7. {
  8. int i;
  9. if (x<=1)
  10. return 0;// nu e prim
  11.  
  12. if (x%2==0)
  13. return 0;// nu e prim
  14.  
  15.  
  16. for (i=2;i<=x/2;i++)
  17. if (x%i==0)
  18. return 0; // nu e prim
  19.  
  20. return 1; // e prim
  21.  
  22. }
  23. int div(int v[],int s,int d)
  24. {int mij;
  25. if(s==d)
  26. if(nrprim(v[s])==1)
  27. return 1;
  28. else
  29. int mij=(s+d)/2;
  30. return div(v,s,mij)+ div(v,mij+1,d);
  31. }
  32. int main()
  33. {
  34. int i;
  35. cin>>n;
  36. for(i=1;i<=n;i++)
  37. cin>>v[i];
  38. if(div(v,1,n)==n)
  39. cout<<"DA";
  40. else
  41. cout<<"NU";
  42. return 0;
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement