Pollard-Rho算法模板

#include<cstdlib>
#include<cstdio>
#include<ctime>
#define LL128 __int128
#define abs(a) ((a)>0?(a):-(a))
namespace Miller_Rabin
{
	const int Pcnt=12;
	const LL128 p[Pcnt]={2,3,5,7,11,13,17,19,61,2333,4567,24251};
	inline LL128 pow(register LL128 a,register LL128 b,register LL128 p)
	{
		register LL128 ans=1;
		for(;b;a=a*a%p,b>>=1)if(b&1)ans=ans*a%p;
		return ans;
	}
	inline bool check(register LL128 x,register LL128 p)
	{
		if(x%p==0||pow(p%x,x-1,x)^1)return true;
		register LL128 t,k=x-1;
		while((k^1)&1)
		{
			t=pow(p%x,k>>=1,x);
			if(t^1&&t^x-1)return true;
			if(!(t^x-1))return false;
		}return false;
	}
	inline bool MR(register LL128 x)
	{
		if(x<2)return false;
		for(register int i=0;i^Pcnt;++i)
		{
			if(!(x^p[i]))return true;
			if(check(x,p[i]))return false;
		}return true;
	}
}
namespace Pollard_Rho
{
	#define Rand(x) (1ll*rand()*rand()%(x)+1)
	inline LL128 gcd(const LL128 a,const LL128 b){return b?gcd(b,a%b):a;}
	inline LL128 mul(const register LL128 x,const register LL128 y,const register LL128 X)
	{
		LL128 k=(1.0L*x*y)/(1.0L*X)-1,t=x*y-k*X;
		while(t<0)t+=X;return t;
	}
	inline LL128 PR(const register LL128 x,const register LL128 y)
	{
		register int t=0,k=1;register LL128 v0=Rand(x-1),v=v0,d,s=1;
		while(true)
		{
			v=(mul(v,v,x)+y)%x,s=mul(s,abs(v-v0),x);
			if(!(v^v0)||!s)return x;
			if(++t==k){if((d=gcd(s,x))^1)return d;v0=v,k<<=1;}
		}
	}
	inline void Resolve(register LL128 x,register LL128&ans)
	{
		if(!(x^1)||x<=ans)return;
		if(Miller_Rabin::MR(x)){if(ans<x)ans=x;return;}
		register LL128 y=x;while((y=PR(x,Rand(x)))==x);while(!(x%y))x/=y;
		Resolve(x,ans);Resolve(y,ans);
	}
	inline long long check(LL128 x)
	{
		register LL128 ans=0;Resolve(x,ans);
		return ans;
	}
}
signed main()
{
	srand(20060926);
	register int t;scanf("%d",&t);
	long long register x,res;
	for(;t;--t)
	{
		scanf("%lld",&x);
		if((res=Pollard_Rho::check(x))^x)printf("%lld\n",res);//res¼´×î´óµÄÖÊÒò×Ó 
		else printf("Prime\n");
	}
}