10206. 「一本通 6.3 练习 1」X-factor Chain

#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define ll long long
using namespace std;
inline ll read(){
    ll res=0,f=1;char ch=getchar();
    while(ch<'0'ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
    return res*f;
}
inline void write(ll x){
    if(x<0) putchar('-'),x=-x;
    if(x<10) putchar(x+'0');
    else{
        write(x/10);
        putchar(x%10+'0');
    }
}
//queue<ll> q;
//set<ll> s;
//priority_queue<ll> q1;
//priority_queue<ll,vector<ll>,greater<ll> > q2;
//list<ll> l;
//stack<ll> s;
ll x,prime[1024*1024+10],f[1024*1024+10],tot;
ll pw[1024];
void primes(){
    for(ll i=2;i<=1024*1024;i++){
        if(f[i]==0){
            prime[++tot]=i;
            for(ll j=i*2;j<=1024*1024;j+=i){
                f[j]=1;
            }
        }
    }
}
vector<pair<ll,ll> > v;
void work(ll n){
    v.clear();
    ll p=n,fk=0;
    for(ll i=1;prime[i]<=n&&i<=tot;i++){
        ll fsum=0;
        if(p%prime[i]==0){
            while(p%prime[i]==0) fsum++,p/=prime[i];
            v.push_back(make_pair(prime[i],fsum));
            fk+=fsum;
        }
    }
    if(p!=1){
        v.push_back(make_pair(p,1));
        p=1;fk++;
    }
    write(fk);putchar(' ');
    ll Ans=1;
    for(ll i=1;i<=fk;i++) Ans*=i;
    for(ll i=0;i<v.size();i++){
        ll fg=v[i].second,ttt=1;
        for(ll j=1;j<=fg;j++) ttt*=j;
        Ans/=ttt;
    }
    write(Ans);putchar('\n');
}
int main(){
    primes();
    while(cin>>x) work(x);
    return 0;
}