不可摸数TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):3719AcceptedSubmission(s):976ProblemDescriptions(n)是正整数n的真因子之和,即小于n且整除n的因子和.例如s(12)=12346=16.如果任何数m,s(m)都不等于n,则称n为不可摸数.Input包含多组数据,首先输入T,表示有T组数据.每组数据1行给出n(2=n=1000)是整数。Output如果n是不可摸数,输出yes,否则输出noSampleInput3258SampleOutputyesyesnoAuthorZhousc@ECJTUSourceECJTU2008SpringContestRecommend代码是#includestdio.hmain(){intri,repeat,i,j,n,d,s;scanf(\"%d\",for(ri=1;ri=repeat;ri){scanf(\"%d\",d=0;for(i=2;i2*n;i){s=0;for(j=1;j=i/2;j){if(i%j==0)s=sj;}if(s==n)d=1;}if(d==1)printf(\"no\\n\");elseprintf(\"yes\\n\");}}
|