模板

a的b次幂对mod取余

ll mod_pow(ll a, ll b, ll mod)
{
	if(b==0) return 1;
	ll res=mod_pow(a*a%mod, b/2, mod);
	if(b%2==1) res=res*a%mod;
	return res;
 } 

判断素数

ll prime(ll n)
 {
 	if(n==2) return 1;
 	if(n<=1||n%2==0) return 0;
 	long long j=3;
 	while(j<=(long long)sqrt(double(n)))
 	{
 		if(n%j==0)
 			return 0;
 		j+=2;
	 }
	 return 1;
 }