package NewCode;
import java.util.Scanner;
/**
* Created by gaoji on 2017/3/25.
*/
public class Main {
static double[] pos = new double[101];
static double[][] p= new double[101][101];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
for (int i = 0; i < n; i++) {
pos[i] = 1.0* in.nextInt()/100;
}
p[0][0] =1;
for (int i = 1; i < p.length; i++) {
p[i][0] = p[i-1][0]*(1-pos[i]);
for (int j = 1; j <= i ; j++) {
p[i][j] = p[i-1][j]*(1-pos[i-1])+p[i-1][j-1]*pos[i-1]; //状态转换
}
}
int pass =(int)Math.ceil(n*0.6);
double result =0;
for (int i = pass; i <= n ; i++) {
result += p[n][i];
}
java.text.DecimalFormat df =new java.text.DecimalFormat("0.00000");
System.out.println(df.format(result));
}
}
思想:利用动态规划,求出i道题中对j道的概率,利用递推关系式。