Educational Codeforces Round 23 B - Makes And The Product

简单排列组合，又来水了俩水题。。。

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;

map<ll,ll> table;
ll n,num;

ll C(ll n, ll m)
{
    ll res = 1;
    for(ll i = 1; i <= m; ++i)
        res = res*(n-m+i)/i;
    return res;
}

int main()
{
    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        cin >> num;
        table[num]++;
    }
    int i = 0;
    ll sum = 0;
    for(map<ll,ll>::iterator it = table.begin(); it != table.end(); ++it,++i)
    {
        sum += it->second;
        if(i == 0)
        {
            if(it->second >= 3)
            {
                cout << C(it->second,3) << endl;
                return 0;
            }
        }
        else if(i == 1)
        {
            if(sum >= 3)
            {
                if(sum-it->second == 2)
                    cout << it->second << endl;
                else
                    cout << C(it->second,2) << endl;
                return 0;
            }
        }
        else
        {
            cout << it->second << endl;
            return 0;
        }
    }
    return 0;
}