原题:
Apple
描述:
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.
(链接:https://acs.jxnu.edu.cn/problem/ICPCJX2020B)
翻译:
苹果
有一箱苹果,里面有N个苹果。你打算把它们分给M个人,要求每个人得到正整数个苹果并且每个人的苹果数不同。如果可以做到,输出possible,否则输出impossible。
输入:
第一行包含一个正整数T(1<=T<=5)代表测试数组
在接下来的T行,每行两个正整数N,M(1<=N<=1000000,1<=M<=1000)
输出:
对于每个测试数组输出在一行。如果可以做到,输出possible,否则输出impossible。