Hi :)
Can anybody please describe how to solve this problem? Codeforces.com/A_Simple_Task
thanks a lot
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 158 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/23/2025 07:54:08 (l2).
Desktop version, switch to mobile version.
Supported by
Maybe this article will help you http://codeforces.net/blog/entry/337. Read it, understand it and finally implement it. Hope it helps.
P.S. UVa online judge has a lot of tasks connected with combined dp with bitmasks. Here is a link, if you are interested http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=437.
thx:)