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 | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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 ???!!