Need help on this problem. Unable to understand how to solve it using dynamic programming approach (for 1<n<200) even after reading the editorial.
→ Pay attention
Before contest
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
36:15:03
Register now »
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
36:15:03
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 2 | adamant | 163 |
| 4 | maroonrk | 152 |
| 5 | nor | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | TheScrasse | 147 |
| 7 | atcoder_official | 147 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
→ Find user
→ Recent actions
History
Revisions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/29/2024 05:19:58 (k2).
Desktop version, switch to mobile version.
Supported by
