I am unable to solve this problem http://codeforces.com/contest/441/problem/E .Can you guys provide me with some hints?
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I am unable to solve this problem http://codeforces.com/contest/441/problem/E .Can you guys provide me with some hints?
Name |
---|
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;
}
~~~~~