Advertisement
Guest User

Untitled

a guest
Feb 26th, 2020
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.92 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4. void cit(int n,int v[25])
  5. { if(n!=0)
  6. {cit(n-1,v);
  7. cout<<"v["<<n<<"]=";
  8. cin>>v[n];
  9. }
  10. }
  11. int prim(int x,int i)
  12. {
  13. if(i>x/2)
  14. return 1;
  15. if(x%i==0)
  16. return 0;
  17. return prim(x,i+1);
  18. }
  19. int suma(int n,int v[25],int st,int dr)
  20. {
  21. if(st==dr)
  22. {
  23. if(prim(v[st],2))
  24. return v[st];
  25. else
  26. return 0;
  27. }
  28. return suma(n,v,st,(st+dr)/2)+suma(n,v,(st+dr)/2+1,dr);
  29. }
  30. int contor(int n,int v[25],int st,int dr)
  31. {
  32. if(st==dr)
  33. {
  34. if(prim(v[st],2))
  35. return 1;
  36. else
  37. return 0;
  38. }
  39. return contor(n,v,st,(st+dr)/2)+contor(n,v,(st+dr)/2+1,dr);
  40. }
  41. int main()
  42. {
  43. int v[25],n, st,dr;
  44. cout<<"n=";
  45. cin>>n;
  46. cit(n,v);
  47. if(contor(n,v,1,n)!=0)
  48. cout<<(float)suma(n,v,1,n)/contor(n,v,1,n);
  49. else
  50. cout<<"nu";
  51.  
  52. return 0;
  53. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement