Bzoj1856:[Scoi2010]字符串:组合数学

题目链接：1856:[Scoi2010]字符串

《脑洞大开系列》……

Orz题解

写得这么好我还用写啥

#include<cstdio>
#define LL long long
#define mod 20100403

LL powe(LL x,LL y){
	LL ret=1;
	while (y){
		if (y&1) ret=ret*x%mod;
		x=x*x%mod; y>>=1;
	}return ret;
}

LL qfac(LL x){
	LL ret=1;
	for (int i=2;i<=x;++i) ret=ret*i%mod;
	return ret;
}

LL C(LL x,LL y){
	return qfac(x)*(powe(qfac(x-y)*qfac(y)%mod,mod-2))%mod;
}

int main(){
	LL n,m; scanf("%lld%lld",&n,&m);
	printf("%lld\n",(C(n+m,n)-C(n+m,m-1)+mod)%mod);
}