Zbrka

#include <bits/stdc++.h>
#define P 1000000007
#define ll long long

using namespace std;



int main(){
    int q;
    cin >> q;

    for(int n=1; n<=q; n++){
        int d[1010] = {0};

        vector<int> v;
        for(int i=1; i<=n; i++) v.push_back(i);

        while(next_permutation(v.begin(), v.end())){
            int s = 0;
            for(int i=0; i<n; i++){
                for(int j=i+1; j<n; j++){
                    if(v[i]>v[j]) s++;
                }
            }
            d[s]++;
        }
        d[0] = 1;
        for(int i=0; i<n*n/2; i++) cout << d[i] << ' ';
        cout << '\n';
    }

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED