Merkkijono

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	string s;
	cin >> s;
 
	vector<int> a(26);
	for (unsigned int i = 0; i < a.size(); i++)
		a[i] = (int)s[i] - 65;
 
	vector<int> b = a;
	sort(b.begin(), b.end());
 
	int k = 0;
	int h;
	vector<int> m;
	while(b != a) {
		k++;
		if (a[0] > a[1] && a[1] != 0) {
			m.push_back(0);
			h = a[1];
			a.erase(a.begin() + 1);
			a.insert(a.begin(), h);
		} else {
			m.push_back(1);
			a.insert(a.begin(), a.back());
			a.pop_back();	
		}
		if (k > 1000000)
			return 1;
	}
 
	cout << k << endl;
	for (unsigned int i = 0; i < m.size(); i++)
		cout << ((m[i])?"MOVE":"SWAP") << endl;
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED