I am unable to solve this problem http://codeforces.net/contest/441/problem/E .Can you guys provide me with some hints?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
I am unable to solve this problem http://codeforces.net/contest/441/problem/E .Can you guys provide me with some hints?
Название |
---|
Here.
I tried reading the editorial but I am not getting it (may be it is too advance !). But I found that some people solved the problem in few lines can you explain the dp states
p: is the probability of getting number smaller than p ~~~~~
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= n; ++j)
if (!i)
for (int a = x + j; !(a & 1); ++f[i][j], a >>= 1);
else
{
f[i][j] += f[i — 1][j + 1] * (1.0 — p);
if (!(j & 1))
f[i][j] += (f[i — 1][j / 2] + 1) * p;
}
~~~~~