#include <stdio.h>
#include <stdbool.h>
bool isPrime(int n) {
if (n <= 1) {
return false;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
int primes[1000];
int count = 0;
for (int i = 1; i <= 1000; i++) {
if (isPrime(i)) {
primes[count] = i;
count++;
}
}
printf("Prime numbers from 1 to 1000:\n"); for (int i = 0; i < count; i++) {
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRib29sLmg+Cgpib29sIGlzUHJpbWUoaW50IG4pIHsKICAgIGlmIChuIDw9IDEpIHsKICAgICAgICByZXR1cm4gZmFsc2U7CiAgICB9CiAgICBmb3IgKGludCBpID0gMjsgaSAqIGkgPD0gbjsgaSsrKSB7CiAgICAgICAgaWYgKG4gJSBpID09IDApIHsKICAgICAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiB0cnVlOwp9CgppbnQgbWFpbigpIHsKICAgIGludCBwcmltZXNbMTAwMF07CiAgICBpbnQgY291bnQgPSAwOwoKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IDEwMDA7IGkrKykgewogICAgICAgIGlmIChpc1ByaW1lKGkpKSB7CiAgICAgICAgICAgIHByaW1lc1tjb3VudF0gPSBpOwogICAgICAgICAgICBjb3VudCsrOwogICAgICAgIH0KICAgIH0KCiAgICBwcmludGYoIlByaW1lIG51bWJlcnMgZnJvbSAxIHRvIDEwMDA6XG4iKTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgY291bnQ7IGkrKykgewogICAgICAgIHByaW50ZigiJWQgIiwgcHJpbWVzW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKCiAgICByZXR1cm4gMDsKfQ==