2746766_wa.java

北大大牛代码 1240道题的原代码 超级权威

import java.math.*;
import java.util.*;

public class Main
{
	public static void main(String[] args)  throws Exception 
	{
		Scanner cin = new Scanner(System.in);
		int num[][] = new int [103][2];
		int n, i, j, now, t;
		int tree[] = new int [103];
		int deg[] = new int [103];
		BigInteger a, c = BigInteger.valueOf(1);
		BigInteger d = new BigInteger ("9901");
		
		while(true)
		{
			n = cin.nextInt();
			if (n==0)
				break;
			now = 1;
			for(i = 0; i <= n; i++)
			{
				deg[i] = 1;
				for(j = 0; j < 2; j++)
					num[i][j] = -1;
			}
			for(i = 0; i < n; i++)
			{
				tree[now] = cin.nextInt();
				if(i!=0)
				{
					t = 1;
					while(true)
					{
						if(tree[now]>=tree[t])
						{
							if(num[t][1]==-1)
							{
								deg[t]++;
								num[t][1] = now;
								break;
							}
							else
							{
								deg[t]++;
								t = num[t][1];
							}
						}
						else
						{
							if(num[t][0]==-1)
							{
								deg[t]++;
								num[t][0] = now;
								break;
							}
							else
							{
								deg[t]++;
								t = num[t][0];
							}
						}
					}
				}
				now++;
			}
			a = c;
			for(i = 1; i <= n; i++)
				a = a.multiply(BigInteger.valueOf(i));
			for(i = 1; i <= n; i++)
				a = a.divide(BigInteger.valueOf(deg[i]));
			System.out.println(a.mod(d));
		}
	}

}