| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
How to find the number of concave corners of a polygon?
Good day, Codeforces!
Given a polygon with N vertices, where the vertices(x[i], y[i]) are listed in counterclockwise order, you need to determine the number of concave angles in the polygon. To better understand what is meant, refer to the provided illustrations:
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
yuaksoinocenow | 2024-08-29 20:05:08 | 370 | (published) | |
| en1 |
|
yuaksoinocenow | 2024-08-29 19:56:21 | 325 | Initial revision (saved to drafts) |
