Points Inside A Polygon

You are given a convex polygon with N vertices. You have to find any ⌊N/10⌋ distinct points with integer coordinates that lie strictly inside the polygon, or determine that such a set of points doesn't exist. Note: ⌊⌋ denotes the floor function, typically used in integer division. Input - The first line of the input contains a single integer T denoting the number of test cases. The description