#include <stdio.h>
int is_prime(int n) {
if (n <= 1) return 0;
if (n == 2) return 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return 0;
}
return 1;
}
void list_prime_numbers(int m) {
printf("%dまでの素数は以下の通りです:\n", m
); for (int n = 2; n <= m; n++) {
if (is_prime(n)) {
}
}
}
int main() {
int m;
list_prime_numbers(m);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgaXNfcHJpbWUoaW50IG4pIHsKICAgIGlmIChuIDw9IDEpIHJldHVybiAwOyAKICAgIGlmIChuID09IDIpIHJldHVybiAxOyAKICAgIGZvciAoaW50IGkgPSAyOyBpICogaSA8PSBuOyBpKyspIHsKICAgICAgICBpZiAobiAlIGkgPT0gMCkgcmV0dXJuIDA7IAogICAgfQogICAgcmV0dXJuIDE7Cn0Kdm9pZCBsaXN0X3ByaW1lX251bWJlcnMoaW50IG0pIHsKICAgIHByaW50ZigiJWTjgb7jgafjga7ntKDmlbDjga/ku6XkuIvjga7pgJrjgorjgafjgZk6XG4iLCBtKTsKICAgIGZvciAoaW50IG4gPSAyOyBuIDw9IG07IG4rKykgewogICAgICAgIGlmIChpc19wcmltZShuKSkgewogICAgICAgICAgICBwcmludGYoIiVkLCAiLCBuKTsKICAgICAgICB9CiAgICB9CiAgICBwcmludGYoIlxuIik7Cn0KCmludCBtYWluKCkgewogICAgaW50IG07CiAgICBwcmludGYoIuaVtOaVsOOCkuWFpeWKm+OBl+OBpuOBj+OBoOOBleOBhDogIik7CiAgICBzY2FuZigiJWQiLCAmbSk7CiAgICBsaXN0X3ByaW1lX251bWJlcnMobSk7CiAgICByZXR1cm4gMDsKfQo=