The problem link is : Problem
I can only think of an exponential checker.
What complexity checkers are feasible for contest problems in polygon ?
How to efficiently Implement a Checker for the problem D in CF 1015
The problem link is : Problem
I can only think of an exponential checker.
What complexity checkers are feasible for contest problems in polygon ?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Kartik-Singh | 2025-04-07 14:57:30 | 76 | ||
| en1 |
|
Kartik-Singh | 2025-04-07 14:55:59 | 193 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
