Hi! I'm looking for the best approaches to finding a solution to greedy (let's say 1800+ difficulty) problems. Are there any implementation tricks worth it to know? How can I find the correct solution faster and eventually be able to prove it?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3687 |
| 2 | ecnerwala | 3600 |
| 3 | Benq | 3503 |
| 4 | ksun48 | 3421 |
| 5 | Um_nik | 3412 |
| 6 | Radewoosh | 3382 |
| 7 | maroonrk | 3323 |
| 8 | Itst | 3239 |
| 9 | apiadu | 3238 |
| 10 | ko_osaga | 3232 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Errichto | 205 |
| 2 | SecondThread | 197 |
| 3 | Monogon | 195 |
| 4 | vovuh | 189 |
| 5 | Um_nik | 185 |
| 5 | pikmike | 185 |
| 7 | antontrygubO_o | 184 |
| 8 | Ashishgup | 182 |
| 9 | pashka | 169 |
| 10 | Radewoosh | 167 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2020 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/27/2020 09:33:51 (f3).
Desktop version, switch to mobile version.
Supported by
tell me if you get the effective answer lol