Merkkijono

#include <bits/stdc++.h>
#define ll long long
 
using namespace std;
string ans;
int cord (string s) {
    int ord = 0;
    int a = 0;
    for (int i = 0; i < 26; i++) {
        if (s[i] == 'A') a = i;
    }
    ord = 1;
    while (ord < 26 && s[(a + ord) % 26] == ans[ord]) ord++;
    ord--;
    return ord;
}
 
int main () {
    string s;
    cin>>s;
    ans = s;
    sort(ans.begin(), ans.end());
    vector<int> lol;
    while (ans != s) {
        if (s[0] > s[1] && s[0] > ans[cord(s)] && s[1] > ans[cord(s)]) {
            swap(s[0], s[1]);
            lol.push_back(1);
        } else {
            char c = s[25];
            s.pop_back();
            s = c + s;
            lol.push_back(2);
        }
        //if (lol.size() < 10) cout<<s<<" "<<cord(s)<<endl;
    }
    cout<<lol.size()<<endl;
    for (int i : lol) {
        if (i == 1) cout<<"SWAP"<<endl;
        else cout<<"MOVE"<<endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED