| Codeforces Round 593 (Div. 2) |
|---|
| Finished |
| Question | Answer | |
|---|---|---|
|
2019-10-17 17:20:12
|
Announcement |
Problem D. Alice and the Doll
***** The doll should visit all cells without obstacles exactly once, so in each cell, the summary number of turns should be no more than one. |
| Name |
|---|


