(I3
I101
I8
(dp0
Vswap.%l
p1
(Vswap.cpp
p2
S'#include <bits/stdc++.h>\r\n#define endl \'\\n\'\r\nusing namespace std;\r\n\r\nconst int maxN = 105;\r\n\r\nbool k = false;\r\nint n, a[maxN];\r\nstack<int> st;\r\n\r\nvoid solve()\r\n{\r\n    if(k) return;\r\n    bool p = true;\r\n    \r\n    for(int i = 0; i < n; i++)\r\n    {\r\n        if(a[i] != i + 1)\r\n        {\r\n            p = false;\r\n            break;\r\n        }\r\n    }\r\n    \r\n    if(p)\r\n    {\r\n        k = true;\r\n        return;\r\n    }\r\n    \r\n    for(int i = 1; i < n; i++)\r\n    {\r\n        if(a[i - 1] != i && a[i] != i + 1 && ((!st.empty() && i != st.top()) || st.empty()))\r\n        {\r\n            swap(a[i - 1], a[i]);\r\n            st.push(i);\r\n            solve();\r\n            if(k) return;\r\n            swap(a[i - 1], a[i]);\r\n            st.pop();\r\n        }\r\n    }\r\n}\r\n\r\nint main()\r\n{\r\n    ios_base::sync_with_stdio(false);\r\n    cin.tie(NULL);\r\n    \r\n    cin>>n;\r\n    for(int i = 0; i < n; i++)\r\n    {\r\n        cin>>a[i];\r\n    }\r\n    \r\n    solve();\r\n    \r\n    cout<<st.size()<<endl;\r\n    while(!st.empty())\r\n    {\r\n        cout<<st.top()<<" "<<st.top() + 1<<endl;\r\n        st.pop();\r\n    }\r\n}'
p3
tp4
stp5
.