Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- inline long long bigmod(long long p,long long e,long long M){
- long long ret = 1;
- for(; e > 0; e >>= 1){
- if(e & 1) ret = (ret * p) % M;
- p = (p * p) % M;
- } return ret;
- }
- template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
- template <class T> inline T modinverse(T a,T M){return bigmod(a,M-2,M);}
Add Comment
Please, Sign In to add comment