描述:
There are a box of apples,which contains N apples. You're going to give them to M person. 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
.
输入:
The first line contains a positive integerT(1≤T≤5)- the number of test cases.
In each of the following T lines there are two positive integers 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
.
样例输入:
3 9 3 12 1 9 4
样例输出:
possible possible impossible
原题链接:Apple | JXNUOJ
翻译:
描述:
有一盒苹果,里面有N个。你将要把它们给M个人。要求每一个人必须被分到正整数个的苹果,并且没有人有相同的数量。如果这可以做到,输出possible;否则输出impossible。
输入:
第一行包含一个测试用例的数量正整数T(1≤T≤5)。
在接下来的T行中,每一个都有两个正整数N,M。(1≤N≤1000000,1≤M≤1000)
输出:
每一个测试用例输出一行。如果这可以做到,输出possible;否则输出impossible。