- //By SiriusRen#include
- #include
- #include using namespace std;
- #defineint long longconst intp=10007;
- int fac[p],inv[p],n,m,cases;
- intC(inti,int j){
- if(ireturn 0;
- if(ireturnfac[i]*inv[j]%p*inv[i-j]%p;
- returnC(i/p,j/p)*C(i%p,j%p)%p;
- }
- signed main(){
- fac[0]=fac[1]=inv[0]=inv[1]=1;
- for(inti=2;i1]*i%p;
- for(inti=2;ip;
- for(inti=1;i1]*inv[i]%p;
- scanf("%lld",&cases);
- while(cases--){
- scanf("%lld%lld",&n,&m);
- printf("%lld\n",C(n,m));
- }
- }
来源: http://www.bubuko.com/infodetail-1983758.html