📄 1016.cpp
字号:
/* This Code is Submitted by wywcgs for Problem 1016 on 2006-01-08 at 22:46:49 */
#include <cstdio>
const int MAX = 32800;
const int N_MAX = 3520;
int main()
{
bool prime[MAX] = { false };
int p[N_MAX], pn = 0;
int n, i, j;
for(i = 2; i < MAX; i++) {
if(!prime[i]) {
p[pn++] = i;
for(j = 2; i*j < MAX; j++) prime[i*j] = true;
}
}
while(scanf("%d", &n) != EOF && n != 0) {
int m = 0;
for(i = n-2; i >= 0; i--) {
m = (m + p[i]) % (n - i);
}
printf("%d\n", m+1);
}
return 0;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -