poj 3604 Professor Ben
2013-07-15 20:36
309 查看
质因数分解;牛人推导公式(1^3+2^3+……+(1+a1)^3)*……*(1^3+2^3+……+(1+ai)^3)……
链接http://poj.org/problem?id=3604
View Code
链接http://poj.org/problem?id=3604
#include<iostream> #include<stdio.h> #include<algorithm> #include<iomanip> #include<cmath> #include<string> using namespace std; int prime[3001],m; bool f[3001]; void init() { int i,j; m=0; memset(f,0,sizeof(f)); for(i=2;i<3000;i++) { if(f[i]==0) { prime[m++]=i; for(j=i*i;j<3000;j+=i) f[i]=1; } } } int main() { init(); __int64 sum,temp; int i,j,a,n,t; scanf("%d",&t); while(t--) { scanf("%d",&n); sum=1; for(i=0;i<m&&prime[i]*prime[i]<=n;i++) { if(n%prime[i]==0) { j=0; while(n%prime[i]==0) { n/=prime[i]; j++; } temp=(j+1)*(j+2)/2; sum*=temp*temp; } } if(n>1) sum*=9; printf("%I64d\n",sum); } return 0; }
View Code
相关文章推荐
- poj 3604 Professor Ben
- poj 3604 Professor Ben 组合计数
- POJ 3604 Professor Ben(合数唯一分解,筛法素数表)
- poj 3604 Professor Ben 因子
- POJ 3604 Professor Ben
- poj 3604 Professor Ben(质因数分解)
- POJ 3604 Professor Ben
- POJ 3604 Professor Ben 数论
- pku 3604 Professor Ben 积性函数加筛法
- poj-3604(数论+推导)
- POJ 1936 All in All
- poj 2398 Toy Storage
- POJ 1873 The Fortified Forest 凸包+枚举
- POJ 3461 Oulipo
- POJ 1753 Flip Game 状态压缩 枚举
- poj_1154LETTERS
- Poj题不完全分类
- POJ 1789 Truck History
- poj 1237(欧拉回路+floyd)
- poj-3177-Redundant Paths-tarjan