Can someone explain the solution to this problem? I've been trying so hard to solve it since yesterday but I couldn't find a solution for it.
https://szkopul.edu.pl/problemset/problem/TE77UNYEUxsFcrRxYRPc99na/site/?key=statement
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | cry | 158 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 151 |
10 | Dominater069 | 150 |
Can someone explain the solution to this problem? I've been trying so hard to solve it since yesterday but I couldn't find a solution for it.
https://szkopul.edu.pl/problemset/problem/TE77UNYEUxsFcrRxYRPc99na/site/?key=statement
Название |
---|
if count(P) is not equal to (count(L) — 4) so should output NIE (for checking that write sum of degrees of maze once with p*270 + L*90 and another time with 180 * (N — 2)) otherwise solution exists
why down votes ???!!