Codeforces Beta Round #95 (Div. 2)

C. The World is a Theatre

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n boys and m girls attending a theatre club. To set a play "The Big Bang Theory", they need to choose a group containing exactly t actors containing no less than 4 boys and no less than one girl. How many ways are there to choose a group? Of course, the variants that only differ in the composition of the troupe are considered different.

Perform all calculations in the 64-bit type: long long for С/С++, int64 for Delphi and long for Java.

<p< p=""><p< p="">

Input

<p< p="">

The only line of the input data contains three integers n, m, t (4 ≤ n ≤ 30, 1 ≤ m ≤ 30, 5 ≤ t ≤ n + m).

<p< p=""><p< p="">

Output

<p< p="">

Find the required number of ways.

Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.

<p< p=""><p< p="">

Sample test(s)

<p< p=""><p< p="">

input

5 2 5

output

10

input

4 3 5

output

3

#include<iostream>
using namespace std;

__int64 c ( int n, int x )
{
    __int64 sum = 1;
    for ( int i = n, j = 1; i > x; i--, j++ )
        sum = sum * i / j;
    return sum;
}

int main()
{
    int b, g, t;
    __int64 sum = 0;
    cin >> b >> g >> t;
    for ( int i = max(4,t-g) ; i <= b && i <= t - 1; i++ )
        sum += c(b,i) * c(g,t-i);
    cout << sum << endl;
}