hdu1261 排列组合 + 高精度

字串数
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5020 Accepted Submission(s): 1339

Problem Description
一个A和两个B一共可以组成三种字符串:”ABB”,”BAB”,”BBA”.
给定若干字母和它们相应的个数,计算一共可以组成多少个不同的字符串.

Input
每组测试数据分两行,第一行为n(1<=n<=26),表示不同字母的个数,第二行为n个数A1,A2,…,An(1<=Ai<=12),表示每种字母的个数.测试数据以n=0为结束.

Output
对于每一组测试数据,输出一个m,表示一共有多少种字符串.

Sample Input
2
1 2
3
2 2 2
0

Sample Output
3
90

公式：（sum!） / (a[0] ! * a[1] ! * a[2] ! ….. a[n - 1]!)
高精度模板要选好，有的高精度模板就超时

#include<bits/stdc++.h>
using namespace std;

const int ten[4] = {1, 10, 100, 1000};
const int maxl = 1000;
struct BigNumber
{
    int d[maxl];
    BigNumber(string s)
    {
        int len = s.size();
        d[0] = (len-1) / 4 + 1;
        int i, j, k;
        for (i=1; i<maxl; ++i) d[i] = 0;
        for (i=len-1; i>=0; --i)
        {
            j = (len-i-1)/4 + 1;
            k = (len-i-1)%4;
            d[j] +=ten[k]*(s[i]-'0');
        }
        while (d[0]>1 && d[d[0]]==0)--d[0];
    }
    BigNumber()
    {
        *this = BigNumber(string("0"));
    }
    string toString()
    {
        string s("");
        int i, j, temp;
        for (i=3; i>=1; --i) if(d[d[0]]>=ten[i]) break;
        temp = d[d[0]];
        for (j=i; j>=0; --j)
        {
            s = s + (char)(temp/ten[j]+'0');
            temp%=ten[j];
        }
        for (i=d[0]-1; i>0; --i)
        {
            temp = d[i];
            for (j=3; j>=0; --j)
            {
                s = s+(char)(temp/ten[j]+'0');
                temp %= ten[j];
            }
        }
        return s;
    }
} zero("0"), d, temp, mid1[15];

BigNumber operator*(const BigNumber &a, const BigNumber &b)
{
    BigNumber c;
    c.d[0] = a.d[0]+b.d[0];
    int i, j, x;
    for (i=1; i<=a.d[0]; ++i)
    {
        x = 0;
        for (j=1; j<=b.d[0]; ++j)
        {
            x = a.d[i] * b.d[j] + x + c.d[i+j-1];
            c.d[i+j-1] = x % 10000;
            x /= 10000;
        }
        c.d[i+b.d[0]] = x;
    }
    while ((c.d[0]>1) && (c.d[c.d[0]]==0))--c.d[0];
    return c;
}

BigNumber operator *(const BigNumber &a, const int &k)
{
    BigNumber c;
    c.d[0] = a.d[0];
    int i, x=0;
    for (i=1; i<=a.d[0]; ++i)
    {
        x = a.d[i]*k + x;
        c.d[i] = x % 10000;
        x /= 10000;
    }
    while (x > 0)
    {
        c.d[++c.d[0]] = x % 10000;
        x /= 10000;
    }
    while ((c.d[0]>1) && (c.d[c.d[0]]==0)) --c.d[0];
    return c;
}

bool smaller(const BigNumber &a, const BigNumber &b, int delta)
{
    if (a.d[0]+delta!=b.d[0]) return a.d[0]+delta<b.d[0];
    int i;
    for (i=a.d[0]; i>0; --i) if (a.d[i]!=b.d[i+delta])
        return a.d[i]<b.d[i+delta];
    return true;
}

void Minus(BigNumber &a, const BigNumber &b, int delta)
{
    int i, x=0;
    for (i=1; i<=a.d[0]-delta; ++i)
    {
        x = 10000+a.d[i+delta]-b.d[i]+x;
        a.d[i+delta]=x%10000;
        x=x/10000-1;
    }
    while ((a.d[0]>1) && (a.d[a.d[0]]==0)) --a.d[0];
}



BigNumber operator /(const BigNumber &a, const BigNumber &b)
{
    BigNumber c;
    d=a;
    int i, j, temp;
    mid1[0] = b;
    for (i=1; i<=13; ++i)
    {
        mid1[i] = mid1[i-1]*2;
    }
    for (i=a.d[0]-b.d[0]; i>=0; --i)
    {
        temp = 8192;
        for (j=13; j>=0; --j)
        {
            if (smaller(mid1[j], d, i))
            {
                Minus(d, mid1[j], i);
                c.d[i+1]+=temp;
            }
            temp /=2;
        }
    }
    c.d[0] = max(1, a.d[0]-b.d[0]+1);
    while ((c.d[0]>1) && (c.d[c.d[0]]==0)) --c.d[0];
    return c;
}

int n;
const int maxn = 12 * 28;
int a[maxn];
BigNumber jc[maxn];

void getjc()
{
    jc[1] = BigNumber("1");
    for (int i=2; i<maxn; ++i)
    {
        jc[i] = jc[i-1] * i;
    }
    return;

}

void solve()
{
    int sum = 0;
    for (int i=0; i<n; ++i) sum+=a[i];
    BigNumber ans = jc[sum];
//    cout << ans.toString() << endl;
    for (int i=0; i<n; ++i) ans = ans / jc[a[i]];
    cout << ans.toString() << endl;
    return;
}


int main()
{
    getjc();
    while(~scanf("%d",&n))
    {
        if(n == 0){
            break;
        }
        for(int i = 0;i < n;++i)
        {
            scanf("%d",&a[i]);
        }
        solve();
    }
    return 0;
}

用sum！对分母进行约分，一定能将分母约尽

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define N 28
#define MAX 5000
int a[N];
int gcd(int a,int b)
{
    return (b == 0) ? a : gcd(b,a % b);
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n == 0)
            break;
        int s2[MAX];
        int cnt = 0;
        for(int i = 0;i < n;++i)
        {
            scanf("%d",&a[i]);
            cnt += a[i];
        }
        for(int i = 1;i <= cnt;++i)
        {
            s2[i] = i;
        }
        //cout << 0 << endl;
        //用s2[i]全部整除被除数
        for(int k = 0;k < n;++k)
        {
            for(int i = 2;i <= a[k];++i)
            {
                int m = i;
                while(m > 1)
                {
                    for(int j = 1;j <= cnt;++j)
                    {
                        int m1 = gcd(s2[j],m);
                        m = m / m1;
                        s2[j] = s2[j] / m1;
                    }
                }
            }
        }
        //cout << 0 << endl;
        int sum[MAX];
        memset(sum,0,sizeof(sum));
        sum[0] = 1;
        for(int i = 2;i <= cnt;++i)
        {
            int flag = 0;
            if(s2[i] != 1){
                for(int j = 0;j < 500;++j)
                {
                    int ss = sum[j] * s2[i] + flag;
                    sum[j] = ss % 10;
                    flag = ss / 10;
                }
            }
        }
        int i;
        for(i = 500;!sum[i];--i);
        //cout << i << endl;
        for(int j = i;j >= 0;--j)
            printf("%d",sum[j]);
        printf("\n");
    }
    return 0;
}