Icpc江西省赛：B-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".

示例1

输入

复制3 9 3 12 1 9 4

3
9 3
12 1
9 4

输出

复制possible possible impossible

possible
possible
impossible

分析：因为是所有分到的苹果都是不相同的，所以就是一个等差数列

#include <bits/stdc++.h>
using namespace std ;

int main(){
	int t , n , m ;
    cin >> t ; 
    for(int i =0 ;i<t ;i++){
        cin >>n >>m ; 
        int sum = 0 ;
        for(int  j = 1; j<=m ;j++){
            sum+= j;
        }
        
        if(sum>n){
            cout << "impossible" <<endl;
        }else {
            cout << "possible" <<endl;
        }
    }
}