#include <stdio.h>
void func(int n)
{
static int count=0;
count++;
printf("%dは%d番目の素数\n", n
, count
); }
//引数nが素数かどうかの判定をします
//素数なら1を戻り値として返し,素数でなければ0を返します
int prime(int n)
{
int i;
int sosuu = 1;
for(i=2; i<n; i++)
{
if(n%i == 0)
{
sosuu=0;
break;
}
}
return sosuu;
}
int main(void)
{
int x;
for(int i=2; i<20;i++)
{
x = prime(i);
if (x == 1)
{
func(i);
}
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CnZvaWQgZnVuYyhpbnQgbikKCXsKCXN0YXRpYyBpbnQgY291bnQ9MDsKCWNvdW50Kys7CgkKICAgIHByaW50ZigiJWTjga8lZOeVquebruOBrue0oOaVsFxuIiwgbiwgY291bnQpOwoJfQovL+W8leaVsG7jgYzntKDmlbDjgYvjganjgYbjgYvjga7liKTlrprjgpLjgZfjgb7jgZkKLy/ntKDmlbDjgarjgonvvJHjgpLmiLvjgorlgKTjgajjgZfjgabov5TjgZfvvIzntKDmlbDjgafjgarjgZHjgozjgbAw44KS6L+U44GX44G+44GZCmludCBwcmltZShpbnQgbikKCXsKICAgIGludCBpOwogICAgaW50IHNvc3V1ID0gMTsKICAgIGZvcihpPTI7IGk8bjsgaSsrKQoJCXsKICAgICAgICBpZihuJWkgPT0gMCkKCQkJeyAKICAgICAgICAgICAJc29zdXU9MDsKICAgICAgICAgICAJYnJlYWs7CiAgICAgICAgCX0KICAgIAl9CiAgICByZXR1cm4gc29zdXU7Cgl9CgppbnQgbWFpbih2b2lkKSAKCXsKICAgIGludCB4OwogICAgZm9yKGludCBpPTI7IGk8MjA7aSsrKQoJCXsKICAgICAgICB4ID0gcHJpbWUoaSk7CiAgICBpZiAoeCA9PSAxKQoJCQl7CiAgICAgICAJCSBmdW5jKGkpOwogICAgCQl9CgkJfQoJcmV0dXJuIDA7Cgl9Cg==