|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||512 MB||64||21||19||31.667%|
You are asked to find a polygon that satisfies all the following conditions, given two integers, xbb and ybb.
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 ≤ 105). Each of the following n lines contains a test case formatted as follows.
xbb and ybb (2 ≤ xbb ≤ 109, 2 ≤ ybb ≤ 109) 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 xi and yi gives the coordinates of the i-th vertex, (xi, yi). The first vertex (x1, y1) 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.
2 5 6 1000000000 2
4 5 6 0 6 0 0 5 0 3 1000000000 0 0 2 999999999 0