代码笔记本

https://codeforces.com/problemset/problem/518/D思路:定义dp[t][j]为到t秒j个人上了电梯的概率转移:dp[t][j]=dp[t-1][j-1]*p+dp[t-1][j]*(1-p);边界:j==0的时候转移仍然要*(1-p)j==n的时候前者的转移是100%的答案是ans+=dp[t][j:0~n]*j#include<iostream>#include<vector>#include&l

https://codeforces.com/problemset/problem/442/B题目描述Andrey needs one more problem to conduct a programming contest. He hasnnfriends who are always willing to help. He can ask some of them to come up with a contest problem. Andrey knows one value for e..

https://codeforces.com/problemset/problem/148/D