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
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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
Name |
---|
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 ???!!