signed main()
{
int n;cin>>n;
get_prime(n);
rep(i,cnt)
{
int p = prime[i];
int t = n,c= 0;
while(t)
{
c+=(t/p);
t/=p;
}
if(c) cout<<p<<" "<<c<<endl;
}
return 0;
}
AcWing 197. 阶乘分解 (线性筛)
最新推荐文章于 2022-04-14 16:46:26 发布