UVA 11076

题目链接

脑子抽了，看错题了，神奇的看成没有0了。主要问题把n个数插入m个相同的数，把m个数给分成1-m堆，然后插到n+1空里。

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <iostream>
using namespace std;
#define MOD 1000000
#define LL long long
LL c[21][21];
int p[21];
int n;
LL judge()
{
    LL ans = 1;
    int i,j,pre = 0;
    LL temp;
    for(i = 0;i < 10;i ++)
    {
        if(p[i])
        {
            temp = 0;
            for(j = 1;j <= p[i];j ++)
            {
                temp += c[pre+1][j]*c[p[i]-1][j-1];
            }
            ans *= temp;
            pre += p[i];
        }
    }
    return ans;
}
int main()
{
    int i,j,num;
    LL ans,temp;
    for(i = 0;i <= 20;i ++)
    c[i][0] = 1;
    for(i = 1;i <= 20;i ++)
    {
        for(j = 1;j <= 20;j ++)
        c[i][j] = c[i-1][j-1] + c[i-1][j];
    }
    while(cin>>n)
    {
        if(!n) break;
        memset(p,0,sizeof(p));
        ans = 0;
        for(i = 0;i < n;i ++)
        {
            cin>>num;
            p[num] ++;
        }
        temp = 1;
        for(i = 1;i < n;i ++)
        {
            temp = temp*10 + 1;
        }
        for(i = 0;i < 10;i ++)
        {
            if(p[i])
            {
                p[i] -- ;
                ans += i*temp*judge();
                p[i] ++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}