摘要：
1 const ll mod=1e9+7; 2 ll qpow(ll a,ll b) 3 { 4 ll c=1; 5 while(b) 6 { 7 if(b&1)c=ll(c*a)%mod; 8 a=ll(a*a)%mod; 9 b>>=1; 10 } 11 return c; 12 } 13 ll C(ll y,ll x) 14 { 15 if(y<0||x<0||y<x)return 0; 1 阅读全文
摘要：
It’s a Mod, Mod, Mod, Mod World 题目描述 You are given multiple problems with three integers p, q, and n. Find . That is, the first n multiples of p, modu 阅读全文