mem 的小站
Rcomb题目描述Na老师有$N$张卷子排成一列，第$i$张卷子有其难度$V_i$，由于X爷的出现，Na老师需要将这些卷子合并为$1$张 每次Na老师以相等的概率随机选择两张相邻卷子，消耗两张卷子难度和的体力，得到一张难度为两张卷子难度和的卷子，求Na老师需要消耗的体力期望值。 输入格式第一行：一个整数$N$。第二行：$N$个整数$V_1$、$V_2$、…、$V_N$。 ...
题目链接 Standard Free2playIntroduceYou are playing a game where your character should overcome different obstacles. The current problem is to come down from a cliff. The cliff has height $h$...
题目链接 Kill ‘Em AllIntroduceIvan plays an old action game called Heretic. He’s stuck on one of the final levels of this game, so he needs some help with killing the monsters.The main part o...
mem 的小站