Sinoka Studies Graphics

Fix one vertex of a convex polygon with $A_i$ vertices and draw diagonals from it to all nonadjacent vertices. This divides the polygon into $A_i-2$ triangles. Print $A_i-2$ for each polygon. The total time complexity is $O(\sum N)$.

Solution written by GPT6