概率期望
文章平均质量分 83
elbadaernu
这个作者很懒,什么都没留下…
展开
-
poj 2096 Collecting Bugs(dp求数学期望)
DescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bu原创 2017-07-23 11:34:09 · 239 阅读 · 0 评论 -
Island of Survival LightOJ - 1265 (概率期望,思维题)
You are in a reality show, and the show is way too real that they threw into an island. Only two kinds of animals are in the island, the tigers and the deer. Though unfortunate but the truth is that, e原创 2017-10-25 19:58:33 · 287 阅读 · 0 评论 -
Dice (III) LightOJ - 1248 (概率dp)
Given a dice with n sides, you have to find the expected number of times you have to throw that dice to see all its faces at least once. Assume that the dice is fair, that means when you throw the dice原创 2017-10-25 01:03:13 · 318 阅读 · 0 评论 -
Race to 1 Again LightOJ - 1038 (概率 dp)
Rimi learned a new thing about integers, which is - any positive integer greater than 1 can be divided by its divisors. So, he is now playing with this property. He selects a number N. And he calls thi原创 2017-10-24 19:55:33 · 268 阅读 · 0 评论 -
Throwing Balls into the Baskets LightOJ - 1317 (巨水水题)
You probably have played the game “Throwing Balls into the Basket”. It is a simple game. You have to throw a ball into a basket from a certain distance. One day we (the AIUB ACMMER) were playing the ga原创 2017-10-26 22:07:59 · 251 阅读 · 0 评论 -
Lights inside 3D Grid LightOJ - 1284 (概率dp+推导)
You are given a 3D grid, which has dimensions X, Y and Z. Each of the X x Y x Z cells contains a light. Initially all lights are off. You will have K turns. In each of the K turns,You select a cell A原创 2017-10-26 00:36:46 · 223 阅读 · 0 评论 -
Pocky HDU - 5984 (求期望+推公式+调和级数)
Problem Description Let’s talking about something of eating a pocky. Here is a Decorer Pocky, with colorful decorative stripes in the coating, of length L. While the length of remaining pocky is long原创 2017-11-28 22:40:06 · 1425 阅读 · 0 评论 -
Expected Cards LightOJ - 1364 (dp求期望+记忆化搜索)
Taha has got a standard deck of cards with him. In addition to the 52 regular ones, there are 2 joker cards. Every regular card has a rank and a suit. The ranks in ascending order are: A, 2, 3, 4, 5, 6原创 2017-11-14 22:27:05 · 365 阅读 · 0 评论 -
Sending Packets LightOJ - 1321 (概率期望+Floyd)
Alice and Bob are trying to communicate through the internet. Just assume that there are N routers in the internet and they are numbered from 0 to N-1. Alice is directly connected to router 0 and Bob i原创 2017-11-15 01:20:28 · 441 阅读 · 1 评论 -
Painting The Wall CodeForces - 398B (简单的期望dp)
User ainta decided to paint a wall. The wall consists of n2 tiles, that are arranged in an n × n table. Some tiles are painted, and the others are not. As he wants to paint it beautifully, he will foll原创 2017-11-21 00:30:48 · 343 阅读 · 0 评论 -
Snakes and Ladders LightOJ - 1151 (高斯消元求期望dp)
‘Snakes and Ladders’ or ‘Shap-Ludu’ is a game commonly played in Bangladesh. The game is so common that it would be tough to find a person who hasn’t played it. But those who haven’t played it (unlucky原创 2017-11-02 15:46:11 · 494 阅读 · 0 评论 -
hdu2262 Where is the canteen(高斯消元求期望dp)
Problem Description After a long drastic struggle with himself, LL decide to go for some snack at last. But when steping out of the dormitory, he found a serious problem : he can’t remember where is t原创 2017-11-02 10:01:39 · 295 阅读 · 0 评论 -
Birthday Paradox LightOJ - 1104 (概率期望)
Sometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party where there are 23 people including you. What is the probability原创 2017-10-25 00:30:50 · 241 阅读 · 0 评论 -
HDU 4405 Aeroplane chess (概率DP & 期望)
Problem Description Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal pro原创 2017-07-24 13:47:06 · 230 阅读 · 0 评论 -
hud 3853 LOOPS (dp求概率期望)
Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped in a la原创 2017-07-25 20:49:59 · 286 阅读 · 0 评论 -
CF #301 (Div. 2) D. Bad Luck Island (概率期望dp)
The Bad Luck Island is inhabited by three kinds of species: r rocks, s scissors and p papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and i原创 2017-08-27 21:12:01 · 378 阅读 · 0 评论 -
A Dangerous Maze LightOJ - 1027 (概率期望)
You are in a maze; seeing n doors 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 the ith door, it can either ta原创 2017-10-19 10:45:47 · 181 阅读 · 0 评论 -
Discovering Gold LightOJ - 1030 (概率期望)
You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.Initially you are in position 1. Now each turn you throw a perfect 6 si原创 2017-10-19 11:10:23 · 173 阅读 · 0 评论 -
Where to Run LightOJ - 1287 (期望dp+状压+dfs)
Last night you robbed a bank but couldn’t escape and when you just got outside today, the police started chasing you. The city, where you live in, consists of some junctions which are connected by some原创 2017-10-27 23:17:04 · 288 阅读 · 0 评论 -
Batting Practice LightOJ - 1408 (求期望+推导公式)
After being all out for 58 and 78 in two matches in the most prestigious tournament in the world, the coach of a certain national cricket team was very upset. He decided to make the batsmen practice a原创 2017-11-07 21:36:46 · 440 阅读 · 1 评论 -
A Dangerous Maze (II) LightOJ - 1395 (dp求期望)
You are in a maze; seeing n doors 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 the ith door, it can either ta原创 2017-11-10 01:16:14 · 406 阅读 · 0 评论 -
Just another Robbery LightOJ - 1079 (概率dp,01背包)
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 money原创 2017-10-24 22:52:19 · 215 阅读 · 0 评论 -
poj 3744 Scout YYF I(概率dp+矩阵快速幂)
DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy’s base. After overcoming a series difficulties, YYF is now at the start of enemy’s famous “min原创 2017-11-25 15:17:07 · 292 阅读 · 0 评论