很简单的数学题(其实主要是考高精度),枚举第一个打出的是什么雪球就可以找出递推式。
假设一共有n个雪球,如果第一次打出的是最小的,并且打在Sanae身上,那么赢的概率就是再打n-1个雪球赢的概率(若打在Cirno身上,他直接输),如果第一次打的是第k小的球,则赢的概率就应是再打n-k个球赢的概率(k前的球不会影响结果)
根据递推关系可得递推式为: dp[n] = 1.0/(2*n)*(dp[n-1]+dp[n-2]+dp[n-3]+......+dp[0])
dp[n-1] = 1.0/(2*n-2)*(dp[0]+dp[1]+...+dp[n-2]) 将dp[n-1]带入dp[n]中可得 dp[n]=(2*n-1)/(2*n)/dp[n-1]
直接用Java BigInteger就可以过了
import java.math.BigInteger;
import java.util.Scanner;
public class HDOJ_1212 {
public static void main(String[] str) {
Integer num;
BigInteger tmp;
BigInteger[] fenzi = new BigInteger[505];
BigInteger[] fenmu = new BigInteger[505];
Scanner cin = new Scanner(System.in);
int k, n;
fenzi[0] = new BigInteger("1");
fenmu[0] = new BigInteger("1");
for (int i = 1; i <= 500; i++) {
num = 2 * i - 1;
tmp = new BigInteger(num.toString());
fenzi[i] = fenzi[i - 1].multiply(tmp);
num = 2 * i;
tmp = new BigInteger(num.toString());
fenmu[i] = fenmu[i - 1].multiply(tmp);
tmp = gcd(fenzi[i], fenmu[i]);
fenzi[i] = fenzi[i].divide(tmp);
fenmu[i] = fenmu[i].divide(tmp);
}
while (cin.hasNext()) {
k = cin.nextInt();
for (int i = 0; i < k; i++) {
n = cin.nextInt();
System.out.println(fenzi[n].toString() + "/"
+ fenmu[n].toString());
}
}
}
public static BigInteger gcd(BigInteger a, BigInteger b) {
if (b.equals(new BigInteger("0")))
return a;
else
return gcd(b, a.mod(b));
}
}