恶俗卡时间题
1.打表;
2.判断n是否为素数,只需判断n是否整除所有小于√n的素数;
3.大于5的相邻素数:
5 7 11 13 17 19 23 25 29 31 35 37 41 43 47 49 53……
素数均非2、3的倍数,则循环时令n分别+2,+4;
代码
#include <stdio.h>
#include <stdlib.h>
int prime(int x, int max, int*m) {
for (int i = 1; m[i] * m[i] <= x; i++)
if (x % m[i] == 0)
return 1;
return 0;
}
int ansk(int* m, int max)
{
int i = *(m + max);
do
{
if (i % 3 == 1)
i += 4;
else if (i % 3 == 2)
i += 2;
} while (prime(i, max, m));
return i;
}
int main()
{
int* m = (int*)malloc(sizeof(int) * 665000);
int max = 3, k;
*(m + 1) = 2;
*(m + 2) = 3;
*(m + 3) = 5;
while (scanf("%d", &k) != EOF)
{
while (k > max)
{
*(m + max + 1) = ansk(m, max);
max++;
}
printf("%d\n", *(m + k));
}
free(m);
return 0;
}
凑合过了,,,