poj 3421 X-factor Chains(分解质因数+组合数学)
2014-08-02 21:34
393 查看
幂和的阶乘/幂阶乘的和
#include<stdio.h>
#include<string.h>
#define ll long long
ll j[25];
void ini()
{
j[1]=1;
for(ll i=2;i<=20;i++)
j[i]=j[i-1]*i;
}
int main()
{
ini();
ll n;
while(scanf("%lld",&n)!=EOF)
{
int ans=0;
ll b=1;
for(ll i=2;i*i<=n;i++)
if(n%i==0)
{
int cnt=0;
while(n%i==0)
{
cnt++;
n/=i;
}
ans+=cnt;
b*=j[cnt];
}
if(n>1) ans+=1;
printf("%d %lld\n",ans,j[ans]/b);
}
return 0;
}
#include<stdio.h>
#include<string.h>
#define ll long long
ll j[25];
void ini()
{
j[1]=1;
for(ll i=2;i<=20;i++)
j[i]=j[i-1]*i;
}
int main()
{
ini();
ll n;
while(scanf("%lld",&n)!=EOF)
{
int ans=0;
ll b=1;
for(ll i=2;i*i<=n;i++)
if(n%i==0)
{
int cnt=0;
while(n%i==0)
{
cnt++;
n/=i;
}
ans+=cnt;
b*=j[cnt];
}
if(n>1) ans+=1;
printf("%d %lld\n",ans,j[ans]/b);
}
return 0;
}
相关文章推荐
- POJ:3421-X-factor Chains(因式分解)(全排列)
- POJ 3421 X-factor Chains
- poj 3421 X-factor Chains
- POJ 3421 X-factor Chains (约数枚举)
- X-factor Chains (poj 3421 数学排列组合)
- POJ 3421 X-factor Chains 排列组合
- poj 3421 X-factor Chains(数因子分解)
- poj 3421 --X-factor Chains(数学、组合)
- POJ 3421 X-factor Chains(数论)(筛法)()
- [poj] 3421 X-factor Chains
- Poj 3421-X-factor Chains
- POJ-3421-X-factor Chains
- 数论·GCD---POJ 3421-X-factor Chains
- Mathematics:X-factor Chains(POJ 3421)
- 【POJ】3421 - X-factor Chains 素数
- 码农场 » POJ 3421 X-factor Chains 题解 《挑战程序设计竞赛》
- POJ 3421 - X-factor Chains(数学)
- POJ 3421 X-factor Chains(构造)
- POJ 3421 X-factor Chains (因式分解+排列组合)
- POJ_3421_X-factor Chains(素数筛法)