记录编号	141361	评测结果	AAAAAAAAAAAAAAAAAAAA
题目名称	[HNOI 2008]明明的烦恼	最终得分	100
用户昵称	cjk	是否通过	通过
代码语言	C++	运行时间	0.163 s
提交时间	2014-11-30 22:31:08	内存使用	0.30 MiB

#include<stdio.h>
#include<stdlib.h>
int d[1005]={0},a[1005]={0},ans[10005]={0};
int pri[1005]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
void fj(int n,int flag)
{
	int i,j;
	for(i=1;pri[i]>0&&pri[i]<=n;i++)
		for(j=pri[i];j<=n;j*=pri[i])
		{
			if(flag==1) a[pri[i]]+=n/j;
			else a[pri[i]]-=n/j;
		}
}
void cheng(int x,int n)
{
	int i;
	for(;n>0;n--)
	{
		for(i=10000;i>0;i--)
			ans[i]*=x;
		for(i=10000;i>0;i--)
			if(ans[i]>=10)
			{
				ans[i-1]+=ans[i]/10;
				ans[i]%=10;
			}
	}
}
int main()
{
	freopen("bzoj_1005.in", "r", stdin);
	freopen("bzoj_1005.out", "w", stdout);
	int n,m,i,j,tot,sum=0,flag=0,p=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&j);
		if(j!=-1)
		{
			d[++p]=j;
			sum+=j;
			if(j==0) flag=1;
		}
	}
	if(n==1)
	{
		if(j==0||j==-1)printf("1");
		else printf("0");
		flag=1;
	}
	else
	{
		if(p==n&&(sum%2!=0||sum/2!=n-1)) flag=1;
		if(flag==1) printf("0");
	}
	if(flag==0)
	{
		tot=sum-p;
		fj(n-2,1);
		m=n-p;
		for(i=1;pri[i]>0&&pri[i]<=m;i++)
		{
			sum=0;
			while(m%pri[i]==0)
			{
				sum++;
				m/=pri[i];
			}
			a[pri[i]]+=sum*(n-2-tot);
		}
		for(i=1;i<=p;i++)
			fj(d[i]-1,0);
		fj(n-2-tot,0);
		ans[10000]=1;
		for(i=1;i<=1000;i++)
			if(a[i]>0) cheng(i,a[i]);
		for(i=0;i<=10000;i++)
			if(ans[i]>0) break;
		for(;i<=10000;i++)
			printf("%d",ans[i]);
	}
	return 0;
}