#include <stdio.h>
int isprime(int n)
{
int i;
if (n % 2 == 0) {
return n == 2;
}
for (i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
void prime(int n)
{
int i;
for (i = 2; i <= n; i++) {
if (isprime(i)) {
}
}
}
int main()
{
prime(100);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgaXNwcmltZShpbnQgbikKewoJaW50CWk7CgoJaWYgKG4gJSAyID09IDApIHsKCQlyZXR1cm4gbiA9PSAyOwoJfQoJZm9yIChpID0gMzsgaSAqIGkgPD0gbjsgaSArPSAyKSB7CgkJaWYgKG4gJSBpID09IDApIHsKCQkJcmV0dXJuIDA7CgkJfQoJfQoJcmV0dXJuIDE7Cn0KCnZvaWQgcHJpbWUoaW50IG4pCnsKCWludAlpOwoKCWZvciAoaSA9IDI7IGkgPD0gbjsgaSsrKSB7CgkJaWYgKGlzcHJpbWUoaSkpIHsKCQkJcHJpbnRmKCIlZFxuIiwgaSk7CgkJfQoJfQp9CgppbnQgbWFpbigpCnsKCXByaW1lKDEwMCk7CglyZXR1cm4gMDsKfQo=