不可摸数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8673 Accepted Submission(s): 2260
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
Author
Zhousc@ECJTU
Source
题目大意:这是我当时做过的,当时我记得是预处理的数组开小了导致一直WA,后来开大了就解决了
import java.io.BufferedInputStream;
import java.util.Arrays;
import java.util.Scanner;
public class P1002_ieayoio {
public static boolean [] f=new boolean[2000010];
public static void main(String[] args) {
Scanner cin=new Scanner(new BufferedInputStream(System.in));
Arrays.fill(f, false);
for (int i=2;i<=2000000;i++){
int j=find(i);
f[j]=true;
}
int T=cin.nextInt();
while (T-->0){
int n=cin.nextInt();
if (f[n]==false) System.out.println("yes");
else System.out.println("no");
}
}
public static int find(int n){
int ans=1;
for (int i=2;i*i<=n;i++){
if (n%i==0){
if (n/i==i) ans+=i;
else ans+=i+(n/i);
}
if (ans>1000) return 0;
}
return ans;
}
}