(I3
I113
I8
(dp0
Vswap.%l
p1
(Vswap.cpp
p2
S'#include<iostream>\r\nusing namespace std;\r\n#include<vector>\r\nint n,a[101];\r\nvector<short> ans;\r\nbool sort(){\r\n    bool podr=true;\r\n    for(int i=0;i<n;i++){\r\n        if(a[i]>a[i+1] && a[i+1]!=i+2 && a[i]!=i+1){\r\n            podr=false;\r\n            int p=a[i];\r\n            a[i]=a[i+1];\r\n            a[i+1]=p;\r\n            if(sort()){\r\n                ans.push_back(i+1);\r\n                return true;\r\n            }\r\n            p=a[i];\r\n            a[i]=a[i+1];\r\n            a[i+1]=p;\r\n        }\r\n    }\r\n    return podr;\r\n}\r\nint main(){\r\n    cin>>n;\r\n    for(int i=0;i<n;i++){\r\n        cin>>a[i];\r\n    }\r\n    sort();\r\n    cout<<ans.size()<<endl;\r\n    for(int i=ans.size()-1;i>=0;i--){\r\n        cout<<ans[i]<<" "<<ans[i]+1<<endl;\r\n    }\r\n    return 0;\r\n}'
p3
tp4
stp5
.