Advertisement
Morass

Combination Number

Jun 4th, 2017
158
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.23 KB | None | 0 0
  1. #define MX (1<<20)
  2. #define MOD (1000000007)
  3. ll f[MX]={1,1},I[MX]={1,1},J[MX]={1,1};
  4. void pre(){FT(2,MX)f[k]=f[k-1]*k%MOD,J[k]=-MOD/k*J[MOD%k]%MOD+MOD,I[k]=I[k-1]*J[k]%MOD;;}
  5. ll C(int N,int K){return N<K?0:(f[N]*I[K]%MOD)*I[N-K]%MOD;}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement