Description
Solution
显然M个人先分别拿1 ~ M个,若不够N个就只需要给第M个人加上凑够即可,但若N < (1+M)*M/2则一定是no
Code
int main(int argc, char const *argv[])
{
int T;scanf("%d",&T);
while(T--) {
int n,m;scanf("%d %d",&n,&m);
ll mi = 1ll * (1+m) * m / 2;
if(n < mi) printf("impossible\n"); else printf("possible\n");
}
return 0;
}