0

hdu 1061 Rightmost Digit

• x292724z 发布于
• 1002 收藏

//模幂运算，而且求个位，一直求10的模 # include # include # include using namespace std; __int64 Pow(__int64 m,__int64 n) { __int64 p=1; while(n) { if(n%2) p=p*m%10; n/=2; ...

0

快速幂取模以及分治法幂取模

• x292724z 发布于
• 1676 收藏

long long qumo(long long a, long long b, long long m) { if(b == 0) return 1; int x = qumo(a,b/2,m); long long ans = (long long)x*x%m; if(b%2==1) ans=ans*a%m; return (int)ans; }//这是...