POJ 1811 Prime Test( Pollard-rho整数分解经典题 ) - ojnQ - 博客园
x >>=1; a =quick_multi( a , a , Mod ); }returnret % Mod; }boolWitness(ll a,ll n){// Miller_Rabin 二次探测ll tmp = n -1;intj =0;while( !( tmp &1) ){ tmp >>=1; j++; } ll x =quick_pow( a , tmp , n );if( x ==1|| x == n-1)returnfalse;while( j--...