hdu 5108——Alexandra and Prime Numbers
2014-11-22 21:19
344 查看
题意:求n的最大素因数
终于红名啦~~~
代码如下:
终于红名啦~~~
代码如下:
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; const int maxn=1000005; bool valid[maxn]; int prime[maxn]; void getprime(int n,int &tot,int ans[maxn]) { memset(valid,1,sizeof(valid)); for(int i=2;i<=n;++i){ if(valid[i]){ tot++; ans[tot]=i; } for(int j=1;((j<=tot)&&(i*ans[j]<=n));j++){ valid[i*ans[j]]=false; if(i%ans[j]==0)break; } } } int factot(int n,int tot) { int tmp,i,now; tmp=(int)((double)sqrt(n)+1); now=n; int ret=0; for(i=1;i<=tot;++i){ if(now%prime[i]==0){ while(now%prime[i]==0){ ret=max(ret,prime[i]); now/=prime[i]; } } } if(now!=1)ret=max(ret,now); return ret; } int main() { // freopen("data.txt","r",stdin); int tot=0; getprime(maxn,tot,prime); int n; while(scanf("%d",&n)!=EOF) { int ans=factot(n,tot); printf("%d\n",ans?n/ans:0); } return 0; }
相关文章推荐
- hdu 5108 Alexandra and Prime Numbers
- HDU 5108 Alexandra and Prime Numbers
- HDU 5108Alexandra and Prime Numbers(大素数)
- 【数论】hdu-5108-Alexandra and Prime Numbers(求最大质因数) (BestCoder Round #19)
- HDU-#5108 Alexandra and Prime Numbers
- HDU-5108-Alexandra and Prime Numbers
- hdu 5108 Alexandra and Prime Numbers
- hdu5108——Alexandra and Prime Numbers(素数)
- hdu 5108 Alexandra and Prime Numbers (水题,暴力)
- BestCoder19 1001.Alexandra and Prime Numbers(hdu 5108) 解题报告
- HDU 5108 Alexandra and Prime Numbers
- hdu 5108 Alexandra and Prime Numbers(水题 / 数论)
- hdu 5108 Alexandra and Prime Numbers(素数)
- HDUOJAlexandra and Prime Numbers
- BestCoder Round #19 1001 Alexandra and Prime Numbers 11.96%(193/1614)
- Alexandra and Prime Numbers(思维)
- Java Program to print Prime numbers in Java - Example Tutorial and Code
- CF385C-(Bear and Prime Numbers)线性筛素数
- hdu acmsteps 2.1.2 How many prime numbers
- hdu 1905 Pseudoprime numbers