原题链接:Apple | JXNUOJ
描述:
There are a box of apples,which contains NN apples. You're going to give them to MM person.
//一箱子苹果一共有NN个。你要把这些苹果分给MM个人。
It is required that everyone must be given a positive integer apple, and no one must have the same amount.
//要求每个人必须分到正整数个苹果,且每个人的苹果数不相同。
If it can be done, output possible
; otherwise output impossible
.
//如果确有解决方案,输出possible;否则的话输出impossible。
输入:
The first line contains a positive integerT(1≤T≤5)T(1≤T≤5)- the number of test cases.
//第一行包含一个正整数T(1≤T≤5),T表示测试样例的数目。
In each of the following TT lines there are two positive integers N,M.(1≤N≤1000000,1≤M≤1000)N,M.(1≤N≤1000000,1≤M≤1000).
//在接下来的T行中,有两个正整数N,M。(1≤N≤1000000,1≤M≤1000)N,M.(1≤N≤1000000,1≤M≤1000).
输出:
For each test case output a line. If it can be done, output possible
; otherwise output impossible
.
//每个测试样例输出一行。如果有答案输出possible;否则的话输出impossible
样例输入:
3 9 3 12 1 9 4
样例输出:
possible possible impossible