(I3
I110
I8
(dp0
Vswap.%l
p1
(Vswap.cpp
p2
S'#include<cstdio>\r\n#include<iostream>\r\n#include<queue>\r\nusing namespace std;\r\n\r\nbool nm[128];\r\nint n;\r\nint a[128];\r\n\r\nbool check ()\r\n{   for(int i=0;i<n-1;i++)\r\n        if(a[i]>a[i+1])return true;\r\n    return false;\r\n}\r\n\r\nint main()\r\n{   scanf("%d",&n);\r\n    if(n==1){scanf("%d",&a[0]);printf("0");}\r\n    for(int i=0;i<n;i++)\r\n    {   int c;\r\n        scanf("%d",&c);\r\n        if(c==i+1)nm[i]++;\r\n        a[i]=c;\r\n    }\r\n    queue<pair<int,int> >res;\r\n    while(check())\r\n        for(int i=0;i<n-1;i++)\r\n        {   if(a[i]>a[i+1]&&!nm[i]&&!nm[i+1]){swap(a[i],a[i+1]);res.push(make_pair(i+1,i+2));}\r\n        }\r\n    \r\n    printf("%d\\n",res.size());\r\n    while(!res.empty())\r\n    {   pair<int,int> a;\r\n        a=res.front();\r\n        res.pop();\r\n        printf("%d %d\\n",a.first,a.second);\r\n    }\r\n        \r\n    \r\n    \r\n    return 0;\r\n}'
p3
tp4
stp5
.