I did the chocolate 2 problem on timus online judge but i don't understand it fully.
my question is that why the number of moves is constant for a specific pair of n and m.
→ Pay attention
Before contest
Helvetic Coding Contest 2024 online mirror (teams allowed, unrated)
20:03:33
Register now »
Helvetic Coding Contest 2024 online mirror (teams allowed, unrated)
20:03:33
Register now »
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Find user
→ Recent actions
Need help for the chocolate 2 problem on timus online judge
Revision en1, by Quicksvolex, 2022-07-14 22:24:07
History
Revisions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/03/2024 14:01:28 (j2).
Desktop version, switch to mobile version.
Supported by
