Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int prim(int x)
- {
- int i;
- if (x<=1)
- return 0;// nu e prim
- if (x%2==0 && x!=2)
- return 0;// nu e prim
- for (i=3;i<=sqrt(x);i=i+2)
- if (x%i==0)
- return 0; // nu e prim
- return 1; // e prim
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement