不可摸数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13071 Accepted Submission(s): 3455
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
已经AC过的代码:
这里写代码片#include <cstdio>
#include <cstring>
#define maxn 1002
int arr[maxn], sum[1000002];
int main()
{
int n, ok, t, i, addSum = 0, mulSum = 1, j;
for(i = 1; i <= 500000; ++i)
{
for(j = i + i; j <= 1000000; j += i)
sum[j] += i;
}
for(i = 1; i <= 1000000; ++i)
if(sum[i] <= 1000) arr[sum[i]] = 1;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
if(arr[n]) printf("no\n");
else printf("yes\n");
}
return 0;
}