1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//typedef tree < int , null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> TREE;
#define ll long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define speed ios::sync_with_stdio(false);cin.tie();cout.tie();
//#define int long long
//const int mod=1000000007;
//const int mod=1000003;
const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.0000000001;
using namespace std;
int W[42],T[42],S[42];
int main()
{
    speed
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>T[i];
        W[i]=100000;
    }
    W[n]=100000;
    int l=(1<<n);
    for(int i=1;i<l;i++)
    {
        int wynik=0,ile=0;
        for(int j=0;j<n;j++)
        {
            if(!(i&(1<<j)))
                continue;
            ile++;
            for(int k=j+1;k<n;k++)
            {
                if(i&(1<<k)&&T[j]>T[k])
                    wynik++;
            }
        }
        if(wynik<W[ile])
        {
            W[ile]=wynik;
            S[ile]=1;
        }
        else if(wynik==W[ile])
            S[ile]++;
    }
    for(int i=1;i<=n;i++)
        cout<<W[i]<<" "<<S[i]<<"\n";
    return 0;
}