| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
There is a problem in the test cases for problem "Latin Squares", it contains multiple test cases!!
vovuh was the one who actually added this training for div2. He might be the only person who can fix it now.
I really want to fix it but i can't because this training is blocked, part of history, etc :( I hope Mike will help me
Oh no :( I guess I'll make an announcement on the page for now
Can someone explain this in problem J Grid Coloring
• For each blue square, all squares in the rectangle from the top left of the grid to that square must also be blue.
Does this mean if grid[i][j]=Blue then grid[i-x][j-x] will also be Blue? when x=[i-1,0]