Advertisement
Guest User

problema

a guest
Nov 21st, 2017
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.41 KB | None | 0 0
  1. int prim (int x)
  2. { int i,cod=1;
  3. if(x==0 || x==1 || (x%2==0 && x!=2))
  4. cod=0;
  5. for(i=3;i*i<=x;i+=2)
  6. if(x%i==0)
  7. cod=0;
  8. if(cod==1) return 1;
  9. else return 0;
  10. }
  11.  
  12. void P(int x[100],int n,int &s)
  13. {int s1;
  14. if(n==1)
  15. if(prim(x[n-1])==1) s=x[n-1];
  16. else s=0;
  17. else {
  18. P(x,n-1,s1);
  19. if(prim(x[n-1])==1) s=s1+x[n-1];
  20. else s=s1;
  21. }
  22. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement