UVA 11076 - Add Again(组合)

题目链接

脑子抽了，看错题了，神奇的看成没有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[][];
 int p[];
 int n;
 LL judge()
 {
     LL ans = ;
     int i,j,pre = ;
     LL temp;
     for(i = ;i < ;i ++)
     {
         if(p[i])
         {
             temp = ;
             for(j = ;j <= p[i];j ++)
             {
                 temp += c[pre+][j]*c[p[i]-][j-];
             }
             ans *= temp;
             pre += p[i];
         }
     }
     return ans;
 }
 int main()
 {
     int i,j,num;
     LL ans,temp;
     for(i = ;i <= ;i ++)
     c[i][] = ;
     for(i = ;i <= ;i ++)
     {
         for(j = ;j <= ;j ++)
         c[i][j] = c[i-][j-] + c[i-][j];
     }
     while(cin>>n)
     {
         if(!n) break;
         memset(p,,sizeof(p));
         ans = ;
         for(i = ;i < n;i ++)
         {
             cin>>num;
             p[num] ++;
         }
         temp = ;
         for(i = ;i < n;i ++)
         {
             temp = temp* + ;
         }
         for(i = ;i < ;i ++)
         {
             if(p[i])
             {
                 p[i] -- ;
                 ans += i*temp*judge();
                 p[i] ++;
             }
         }
         cout<<ans<<endl;
     }
     return ;
 }