template/学习路径/算法/快速幂.cpp
2025-03-17 00:29:43 +08:00

15 lines
255 B
C++

#include<cstring>
#include<cstdio>
#include<cmath>
const int mod=1;
int ksm(int a, int x) {
int ans = 1;
while (x) {
if (x & 1)
ans = ans * a % mod;
a = (a%mod) * (a%mod) % mod;
x >>= 1;
}
return ans;
}