Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- bool IsPrime(int n) {
- int r=1+0,f=1;for(;f<n/f;r&=n-n!=0+n%++f);
- return r*2-4/n/2;
- }
- int main() {
- int x;
- while (~scanf("%d", &x)) printf("%d\n", (int)IsPrime(x));
- }
Advertisement
Add Comment
Please, Sign In to add comment