| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
I think that all problems looked awful at the first sight but actually all were quite cool :O
editorial (was posted as announcement after the round)
Congratulations to advancers! Results screenshot below (top10 gets to the finals + some early advancers from previous rounds).
Deleted
Can anyone explain how to generate all numbers efficiently in easy problem :)
It's easy to see that almost any answer has all digits in non decreasing order, therefore you can generate them storing current length and last digit.
10
Yes, it is the only one tricky case.
250 can be solved by brute force searching < 1e7, if not found use oeis_seq (goal — base0)
Why aren't ratings being updated? The round was rated, right? hmehta?
Sorry, there was a slight delay coz of the Japan Regional Round Results to be published before this round but they were updated a day later :)