【Purfer】【bzoj 1005】: [HNOI2008]明明的烦恼

http://www.lydsy.com/JudgeOnline/problem.php?id=1005

参考题解

http://www.cnblogs.com/zhj5chengfeng/archive/2013/08/23/3278557.html

http://www.cnblogs.com/noip/archive/2013/03/10/2952520.html

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
int n;
int prim[1010],k; bool flag[1010];
int d[1010]; bool ok=1;
struct bign
{
	int p[400];
	bign(){MS(p,0);}
	void mul(int x,int t)
	{
		for(int i=1;i<=k && x>1;i++)
			while(x%prim[i]==0) p[i]+=t,x/=prim[i];
	}
}ans;
int sum,cnt;
/
void get_prim()
{
	rep(i,2,n)
	{
		if(!flag[i]) prim[++k]=i;
		for(int j=1;j<=k && i*prim[j]<=n;j++)
		{
			flag[i*prim[j]]=1;
			if(i%prim[j]==0) break;
		}
	}
}
/
void input()
{
    rep(i,1,n=read())
    {
    	d[i]=read();
    	if(d[i]<0) continue;
    	if(d[i]==0||d[i]>n-1) ok=0;
    	sum+=d[i]-1; cnt++;
    }
}
void solve()
{
	get_prim();
	if(n==1)
	{
		if(d[1]<=0) puts("1");
		else puts("0");
	}
	else if(n==2)
	{
		if(d[1]<=0&&d[2]<=0) puts("1");
		else puts("0");
	}
	else if(ok==0) puts("0");
	else
	{
		rep(i,n-2-sum+1,n-2) ans.mul(i,1);
		rep(i,1,n) if(d[i]>0)
			rep(j,1,d[i]-1) ans.mul(j,-1);
		ans.mul(n-cnt,n-2-sum);
        
		static int c[10010];
		c[0]=1;
		rep(i,1,k) while(ans.p[i]--)
		{
			rep(j,0,10000) if(c[j]) c[j]*=prim[i];
			rep(j,0,10000) if(c[j]>=10) c[j+1]+=c[j]/10, c[j]%=10;
		}
		int len=10000;
		while(c[len]==0) len--;
		per(i,len,0) putchar(c[i]+'0');
		puts("");
	}
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    input(),solve();
    return 0;
}