不可摸数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8590 Accepted Submission(s): 2242
Problem Description
s(n)是正整数n的真因子之和,即小于n且整除n的因子和.例如s(12)=1+2+3+4+6=16.如果任何
数m,s(m)都不等于n,则称n为不可摸数.
数m,s(m)都不等于n,则称n为不可摸数.
Input
包含多组数据,首先输入T,表示有T组数据.每组数据1行给出n(2<=n<=1000)是整数。
Output
如果n是不可摸数,输出yes,否则输出no
Sample Input
3 2 5 8
Sample Output
yes yes no附代码:#include <stdio.h> #define N 500010 __int64 a[N]; int sum[1010]; void ints () { int i, j, m; m = N/2; for (i=1; i<m; ++i) for (j=i*2; j<N; j+=i) a[j] += i; for (i=0; i<N; i++) if (a[i]<=1000) sum[a[i]]=1; } int main () { int n, i, t; scanf ("%d", &t); ints(); while (t--) { scanf ("%d", &n); if (sum[n]) printf ("no\n"); else printf ("yes\n"); } return 0; }