http://acm.fzu.edu.cn/problem.php?pid=1342 dp[i][j]  , i位尾巴为j的概率 const int maxn = 1008 ; double dp[maxn][12] ; int main(){ int i , j , n , k ; double t ; while(cin>>k>>n){ for(i = 0 ; i <= k ; i++) dp[1][i] = 100.0 / double(k+1) ; for(i = 2…