lightoj
Amo-
某弱校 垃圾 ,,
展开
-
lightoj-1027Dangerous Maze(期望&概率DP)
You are in a maze; seeingndoors in front of you in beginning. You can choose any door you like. The probability for choosing a door is equal for all doors.If you choose theithdoor, it can either...原创 2019-05-23 00:03:33 · 237 阅读 · 0 评论 -
LightOJ - 1030 Discovering Gold(期望&概率DP)
You are in a cave, a long cave! The cave can be represented by a1 x Ngrid. Each cell of the cave can contain any amount of gold.Initially you are in position1. Now each turn you throw a perfect6...原创 2019-05-23 00:09:39 · 135 阅读 · 0 评论 -
LightOJ - 1038 Race to 1 Again(期望&概率DP)
Rimi learned a new thing about integers, which is - any positive integer greater than1can be divided by its divisors. So, he is now playing with this property. He selects a numberN. And he calls th...原创 2019-05-23 00:14:17 · 178 阅读 · 0 评论 -
LightOJ - 1079 Just another Robbery(期望&概率DP)
As Harry Potter series is over, Harry has no job. Since he wants to make quick money, (he wants everything quick!) so he decided to rob banks. He wants to make a calculated risk, and grab as much mone...原创 2019-05-23 00:22:25 · 160 阅读 · 0 评论 -
洛谷 P2473 [SCOI2008]奖励关 (概率dp&&状压)
题目背景08四川NOI省选题目描述你正在玩你最喜欢的电子游戏,并且刚刚进入一个奖励关。在这个奖励关里,系统将依次随机抛出k次宝物,每次你都可以选择吃或者不吃(必须在抛出下一个宝物之前做出选择,且现在决定不吃的宝物以后也不能再吃)。宝物一共有n种,系统每次抛出这n种宝物的概率都相同且相互独立。也就是说,即使前k-1 次系统都抛出宝物1(这种情况是有可能出现的,尽管概率非常小),第k次...原创 2019-05-23 00:32:16 · 192 阅读 · 0 评论