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