Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int prim(int n)
- {
- int d=2;
- if(n<2)
- return 0;
- while(d*d<=n && n%d!=0)
- d++;
- if(d*d<=n)
- return 0;
- else
- return 1;
- }
- void P(int x[101], int n , int &s)
- {
- int m;
- s=0;
- for(int i=0;i<n;i++)
- {
- m=x[i];
- if(prim(m)==1)
- s=s+m;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement