/*不可摸数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8364 Accepted Submission(s): 2154 Problem Description s(n)是正整数n的真因子之和,即小于n且整除n的因子和.例如s(12)=1+2+3+4+6=16.如果任何 数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 Author Zhousc@ECJTU Source ECJTU 2008 Spring Contest */ #include<stdio.h> int a[500010], b[1010]; void f() { int i, j; for(i = 1; i < 250010; i++) for(j = i*2; j < 500010; j += i) a[j] += i; for(i = 1; i < 500010; i++) if(a[i] <= 1000) b[a[i]] = 1; } int main() { int n, i, j; f(); scanf("%d", &n); while(n--) { scanf("%d", &j); if(b[j]) printf("no\n"); else printf("yes\n"); } return 0; }
对不可摸数打表!