(I3
I120
I8
(dp0
Vswap.%l
p1
(Vswap.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nbool used[200];\r\n\r\nstruct svap{\r\n    long long a,b;\r\n};\r\n\r\n svap re6eniq[10000];\r\n\r\nlong long n,masiv[10000],br,minn,index,brSwap=0;\r\nint main(){\r\n    long long posoka;\r\n    cin>>n;\r\n    for(br=1;br<=n;br++){\r\n        cin>>masiv[br];\r\n    }\r\n    bool imaLiOste=true;\r\n    while(imaLiOste){\r\n        imaLiOste=false;\r\n        minn=n+1;\r\n        for(br=1;br<=n;br++){\r\n            if(br!=masiv[br] and masiv[br]<minn){\r\n                if(br<masiv[br]){\r\n                    posoka=1;\r\n                }else{\r\n                    posoka=-1;\r\n                }\r\n                imaLiOste=true;\r\n                minn=masiv[br];\r\n                index=br;\r\n            }\r\n        }\r\n        if(imaLiOste){\r\n            for(br=index;br!=masiv[br];br+=posoka){\r\n                re6eniq[brSwap].a=br;\r\n                re6eniq[brSwap].b=br+posoka;\r\n                swap(masiv[br],masiv[br+posoka]);\r\n                brSwap++;\r\n            }\r\n        }\r\n    }\r\n    cout<<brSwap<<"\\n";\r\n    for(br=0;br<brSwap;br++){\r\n        cout<<re6eniq[br].a<<" "<<re6eniq[br].b<<"\\n";\r\n    }\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.