Description
从
n
个男孩
Input
三个整数
Output
输出方案数
Sample Input
5 2 5
Sample Output
10
Solution
简单组合,枚举男孩数量即可, ans=∑i=max(4,t−m)min(n,t−1)CinCt−im
Code
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f,maxn=100001;
ll C(int n,int m)
{
ll ans=1;
for(int i=1;i<=m;i++)ans=ans*(n-m+i)/i;
return ans;
}
int main()
{
int n,m,t;
while(~scanf("%d%d%d",&n,&m,&t))
{
ll ans=0;
for(int i=4;i<=n;i++)
if(i<t&&t-i<=m)
ans+=C(n,i)*C(m,t-i);
printf("%I64d\n",ans);
}
return 0;
}