hdu #4405:Aeroplane chess
题目描述:http://acm.hdu.edu.cn/showproblem.php?pid=4405
简单的概率dp
#include
#include
#define MAX_N 100007
int y[MAX_N];
double dp[MAX_N];
int main(){
int n, m, i, a, b;
while(scanf("%d%d", &n,
原创
2016-06-20 23:56:22 ·
424 阅读 ·
0 评论