ZOJ3380_Patchouli's Spell Cards_概率DP

题目大意

用n个数填m个位置，每个位置上出现每个数的概率相同，求存在一个数再序列中出现的次数 >=l 的概率。

思路

求概率转化为求   ->  符合要求的序列的数量 / 总序列数量 ->   ( 总序列数量 - 不符合要求的序列的数量) / 总序列数量

不符合要求的序列的数量即序列中每个数出现不超过l

dp[i][j] 表示用前i个数添m个位置上的任意j个位置的情况数量

dp[i][j] = Σdp[i - 1][j - k] * C( m - (j - k), k),  k >= 0 && k <= j && k < l.

边界条件: dp[i][0] = 1,  i >= 0 && i <= n.

则 ans = ( n^m - dp[n][m] ) / n^m

import java.awt.List;
import java.math.BigInteger;
import java.util.Scanner;  
public class Main {
	static int MAXN = 110;
	static BigInteger[][] comb = new BigInteger[MAXN][MAXN];
	static BigInteger[][] dp = new BigInteger[MAXN][MAXN];
	
	public static void main(String[] args)
	{
		int n, m, l;
		for (int i = 0; i < MAXN; i++)
		{
			comb[i][0] = comb[i][i] = BigInteger.valueOf(1);
			
			for (int j = 1; j < i; j++)
			{
				comb[i][j] = comb[i - 1][j].add(comb[i - 1][j - 1]);
				
				
			}
		}
		
		Scanner in = new Scanner(System.in);
		while (in.hasNext())
		{
			
			m = in.nextInt();
			n = in.nextInt();
			l = in.nextInt();
			if (l > m)
			{
				System.out.println("mukyu~");
				continue;
			}
			for (int i = 0; i <= n; i++)
				for (int j = 0; j <= m; j++)
					if (j == 0)
						dp[i][j] = BigInteger.ONE;
					else
						dp[i][j] = BigInteger.ZERO;
			
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= m; j++)
					for (int k = 0; k <= j && k < l; k++)
						dp[i][j] = dp[i][j].add(dp[i - 1][j - k].multiply(comb[m - (j - k)][k]));
						
							
			
			BigInteger tmp = BigInteger.valueOf(n).pow(m);
			
			BigInteger a = tmp.subtract(dp[n][m]);
			
			BigInteger s = a.gcd(tmp);
			
			System.out.println(a.divide(s) + "/" + tmp.divide(s));
			
			
			
			
		}
		
		
		
		
	}

}