| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
challenge — higher limits
Hi guys!
On IOI I've learned many new things, so now I want to give you a challenge. You probably remember my and Errichto's eliminations to VK Cup 2016. Let's focus on this problem: 674C - Levels and Regions
Main solution was solving it in O(n*k), because k wasn't greater than 50. What if k is just lower or equal to n? :D
I'm waiting for your ideas.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
Radewoosh | 2016-08-22 01:12:03 | 2 | Tiny change: 'es(i)-res(r-1)$.\n\nT' - | |
| en4 |
|
Radewoosh | 2016-08-21 19:51:28 | 7 | Tiny change: 'n? :D\n\n\n\n\n 'n? :D\n\n\\\n\n\n | |
| en3 |
|
Radewoosh | 2016-08-21 19:48:43 | 305 | Tiny change: ' n? :D\n\nI'm posting solution below.\n\n\n ' n? :D\n\n\n\n\n | |
| en2 |
|
Radewoosh | 2016-08-21 19:41:55 | 1505 | Tiny change: 'n below that text, if ' - | |
| en1 |
|
Radewoosh | 2016-08-21 18:21:50 | 393 | Initial revision (published) |
