模板1:
//来自lra师哥
typedef long long ll;
ll q_pow(ll a, ll b){
ll ans = 1;
while(b > 0){
if(b & 1){
ans = ans * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return ans;
}
例题1:https://sdnuoj.rainng.com/problem/show/1081
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 10000000
ll q_pow(ll a, ll b){
ll ans = 1;
while