Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void cit(int n,int v[25])
- { if(n!=0)
- {cit(n-1,v);
- cout<<"v["<<n<<"]=";
- cin>>v[n];
- }
- }
- int prim(int x,int i)
- {
- if(i>x/2)
- return 1;
- if(x%i==0)
- return 0;
- return prim(x,i+1);
- }
- int suma(int n,int v[25],int st,int dr)
- {
- if(st==dr)
- {
- if(prim(v[st],2))
- return v[st];
- else
- return 0;
- }
- return suma(n,v,st,(st+dr)/2)+suma(n,v,(st+dr)/2+1,dr);
- }
- int contor(int n,int v[25],int st,int dr)
- {
- if(st==dr)
- {
- if(prim(v[st],2))
- return 1;
- else
- return 0;
- }
- return contor(n,v,st,(st+dr)/2)+contor(n,v,(st+dr)/2+1,dr);
- }
- int main()
- {
- int v[25],n, st,dr;
- cout<<"n=";
- cin>>n;
- cit(n,v);
- if(contor(n,v,1,n)!=0)
- cout<<(float)suma(n,v,1,n)/contor(n,v,1,n);
- else
- cout<<"nu";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement