【HDU - 4344】Mark the Rope（大整数分解）

#include <cstdio>
#include <ctime>
#include <algorithm>
using namespace std;
typedef long long ll;
const int Times=10;
ll gcd(ll a, ll b){
	while(b){
		ll t=a%b;
		a=b;
		b=t;
	}
	return a;
}
ll qmul(ll a, ll b, ll m){
	ll ans=0;
	while(b){
		if(b&1){
			ans=ans+a;
			if(ans>=m)ans-=m;
		}
		a<<=1;
		if(a>=m)a-=m;
		b>>=1;
	}
	return ans;
}
ll qpow(ll a, ll b, ll m){
	ll ans=1;
	while(b){
		if(b&1)
			ans=qmul(ans,a,m);
		a=qmul(a,a,m);
		b>>=1;
	}
	return ans;
}
bool Miller_Rabin(ll n){
	if(n==2)return true;
	if(n<2||!(n&1))return false;
	ll m=n-1,x,y,a;
	int k=0;
	while(!(m&1)){
		++k;
		m>>=1;
	}
	for(int i=0;i<Times;++i){
		a=rand()%(n-1)+1;
		x=qpow(a,m,n);
		for(int j=0;j<k;++j){
			y=qmul(x,x,n);
			if(y==1&&x!=1&&x!=n-1)return false;
			x=y;
		}
		if(y!=1)return false;
	}
	return true;
}
ll pollard_rho(ll n, ll c){
	ll i=1, k=2, x, y;
	x=y=rand()%(n-1)+1;
	while(1){
		++i;
		x=(qmul(x, x, n)+c)%n;
		ll d=gcd((y-x+n)%n, n);
		if(d>1&&d!=n)return d;
		if(y==x)return n;
		if(i==k){
			y=x;
			k<<=1;
		}
	}
}
ll fac[200],cnt;
void find(ll n,int c){
	if(n==1)return;
	if(Miller_Rabin(n)){
		fac[++cnt]=n;
		return;
	}
	ll p=n;
	ll k=c;
	while(p>=n)p=pollard_rho(p,c--);
	find(p,k);
	find(n/p, k);
}
int main(){
	int t;ll n;
	scanf("%d", &t);
	while(t--){
		cnt=0;
		scanf("%lld", &n);
		find(n, 97);
		sort(fac, fac+cnt+1);
		int num=0;
		ll sum=0,tmp=0;
		for(int i=1;i<=cnt;++i){
			if(fac[i]!=fac[i-1]){
				++num;
				sum+=tmp;
				tmp=fac[i];
			}else tmp*=fac[i];
		}
		if(num==1)sum=n/fac[1];
		else sum+=tmp;
		printf("%d %lld\n",num, sum);
	}
	return 0;
}