摘要:
ll modpow(ll a, ll b) { ll ans = 1, base = a%MOD; while(b != 0) { if(b&1 != 0) ans = (ans*base)%MOD; base = (base*base)%MOD; b >>= 1; } return... 阅读全文
摘要:
#include using namespace std; const int MOD=(int)1e9+7; typedef long long ll; ll poww(ll a, ll b) { ll ans = 1, base = a%MOD; while(b != 0) { if(b&1 != 0) ans = (ans*b... 阅读全文