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?
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3556 |
| 2 | wxhtxdy | 3520 |
| 3 | Radewoosh | 3409 |
| 4 | Benq | 3368 |
| 5 | mnbvmar | 3280 |
| 6 | ecnerwala | 3278 |
| 7 | LHiC | 3276 |
| 8 | sunset | 3264 |
| 9 | maroonrk | 3159 |
| 10 | TLE | 3145 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Errichto | 189 |
| 2 | Radewoosh | 177 |
| 3 | tourist | 173 |
| 4 | antontrygubO_o | 172 |
| 5 | PikMike | 166 |
| 5 | Vovuh | 166 |
| 7 | rng_58 | 158 |
| 8 | majk | 156 |
| 9 | farmersrice | 154 |
| 10 | Um_nik | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2019 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/10/2019 09:41:39 (h2).
Desktop version, switch to mobile version.
Supported by
tell me if you get the effective answer lol