HDU 2136 largest prime factor
摘要:
<code>#include<stdio.h>__int64 n;__int64 prime[1000000];int main(){ __int64 i,j; __int64 locate=0; for(i=2;i<1000000;i++) { if(prime[i]==0) { locate++; for(j=i;j<1000000;j+=i) { prime[j]=locate; } } } while(scanf("%I64d",&n)!=EOF) { printf("%I64d\n",prime[n] 阅读全文
posted @ 2011-05-25 20:40 lonelycatcher 阅读(239) 评论(0) 推荐(0) 编辑