UVa 1620 Lazy Susan (找规律)

#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
using namespace std ;
typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f3f;
const double eps = 1e-12;
const int maxn = 1e6 + 5;
const int dr[] = {0, 0, -1, 1};
const int dc[] = {-1, 1, 0, 0};
int n;
int a[505];

int main(){
    int T;  cin >> T;
    while(T--){
        scanf("%d", &n);
        int cnt = 0;
        for(int i = 0; i < n; ++i){
            scanf("%d", &a[i]);
            for(int j = 0; j < i; ++j)
                cnt += (a[i] < a[j]);
        }
        if(cnt & 1 && n & 1)  cout << "impossible\n";
        else  cout << "possible\n";
    }
    return 0;
}