?
?
?
Saving Beans HDU3037 ( 组合数+Lucas定理 )(二)
read(y); } template
inline T read__(T&x,T&y,T&z) { return read(x)&&read(y)&&read(z); } template
inline void write(T x) { if(x<0)putchar('-'),x=-x; if(x<10)putchar(x+'0'); else write(x/10),putchar(x%10+'0'); } template
inline void writeln(T x) { write(x); putchar('\n'); } //-------ZCC IO template------ const int maxn=11; const double inf=999999999; #define lson (rt<<1),L,M #define rson (rt<<1|1),M+1,R #define M ((L+R)>>1) #define For(i,t,n) for(int i=(t);i<(n);i++) typedef long long LL; typedef double DB; typedef pair
P; #define bug printf("---\n"); //#define mod 10007 LL powmod(LL a,LL b,LL mod) { LL rec=1; while(b) { if(b&1)rec=(rec*a)%mod; a=(a*a)%mod; b>>=1; } return rec%mod; } LL C(LL a,LL b,LL mod) { LL ans=1,ca=1,cb=1; if(a
a-b)b=a-b; for(int i=0;i