A15049 | $Boundary$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Each test contains multiple test cases. The first line contains an integer $t$ ( $1\le t\le 100$ ) — the number of test cases. The descriptions of the $t$ test cases follow. Each test case consist of a single line, which contains two integers $w$ , $l$ ( $3 \leq w, l \leq 10^{9}$ ) — the dimensions of the bathroom.

For each test case, print an integer $k$ ( $0\le k$ ) — the number of valid values of $a$ for the given test case — followed by $k$ integers $a_1, a_2,\dots, a_k$ ( $1\le a_i$ ) — the valid values of $a$ . The values $a_1, a_2, \dots, a_k$ have to be sorted from smallest to largest. It is guaranteed that under the problem constraints, the output contains at most $200\,000$ integers.

In the first test case, the bathroom is $3$ centimeters wide and $5$ centimeters long. There are three values of $a$ such that Bethany can tile the floor as described in the statement, namely $a=1$ , $a=2$ and $a=3$ . The three tilings are represented in the following pictures.![](/uploads/acgo/image/404782b220f1d00b_0fa9ec6f2c2f.jpeg)

输入 #1

3
3 5
12 12
314159265 358979323

输出 #1

3 1 2 3
3 1 2 11
2 1 2

C++ 编辑器

输入

输出