13407번 - Skinny Polygon 스페셜 저지다국어

You are asked to find a polygon that satisfies all the following conditions, given two integers, x_bb and y_bb.

• The number of vertices is either 3 or 4.
• Edges of the polygon do not intersect nor overlap with other edges, i.e., they do not share any points with other edges except for their endpoints.
• The x- and y-coordinates of each vertex are integers.
• The x-coordinate of each vertex is between 0 and x_bb, inclusive. Similarly, the y-coordinate is between 0 and y_bb, inclusive.
• At least one vertex has its x-coordinate 0.
• At least one vertex has its x-coordinate x_bb.
• At least one vertex has its y-coordinate 0.
• At least one vertex has its y-coordinate y_bb.
• The area of the polygon does not exceed 25000.

The polygon may be non-convex.

The input consists of multiple test cases. The first line of the input contains an integer n, which is the number of the test cases (1 ≤ n ≤ 10⁵). Each of the following n lines contains a test case formatted as follows.

xbb ybb

x_bb and y_bb (2 ≤ x_bb ≤ 10⁹, 2 ≤ y_bb ≤ 10⁹) are integers stated above.

For each test case, output description of one polygon satisfying the conditions stated above, in the following format.

v
x1 y1
.
.
.
xv yv

Here, v is the number of vertices, and each pair of x_i and y_i gives the coordinates of the i-th vertex, (x_i, y_i). The first vertex (x₁, y₁) can be chosen arbitrarily, and the rest should be listed either in clockwise or in counterclockwise order.

When more than one polygon satisfies the conditions, any one of them is acceptable. You can prove that, with the input values ranging as stated above, there is at least one polygon satisfying the conditions.