hdu 1999

不可摸数

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6345    Accepted Submission(s): 1647

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

 

Recommend

lcy

#include <stdio.h>
#include <string.h>
int flag[1001], s[1000001];
int main()
{
	int t, i, j, n;
	memset(flag, 0, sizeof(flag));
	memset(s, 0, sizeof(s));
	for(i = 1; i < 500001; i++)
		for(j = i*2; j < 1000001; j += i)
			s[j] += i;
	for(i = 1; i < 1000001; i++)
		if(s[i] < 1001)
			flag[s[i]] = 1;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d", &n);
		if(flag[n])
			printf("no\n");
		else
			printf("yes\n");
	}
	return 0;
}