#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
#include<cmath>
using namespace std;
#define ll long long
ll pn,t;
ll n,m;
ll sum;
int main()
{
while(scanf("%lld%lld",&n,&m)!=EOF)
{
if(n==0&&m==0) break;
sum=1;
t=max(n,m);
pn=n+m;
ll p=1;
for(ll i=t+1;i<=pn;i++)
{
sum=sum*i/p;
p++;
}
cout<<sum<<endl;
}
return 0;
}
简单组合数
最新推荐文章于 2021-07-27 23:26:19 发布