Merkkijono

#include<bits/stdc++.h>
using namespace std;

int main() {
	string s;
	cin >> s;

	int n = s.size();

	int idx = 0;
	int c = 0;
	vector<string> ve;
	int co2 = 0;
	while (true) {
		if (s[idx % n] > s[(idx + 1) % n] && !(s[idx % n] == 'Z' && s[(idx+1) % n] == 'A')) {
			swap(s[idx % n], s[(idx + 1) % n]);
			ve.push_back("SWAP");
			c = 0;
		} else {
			idx--;
			if (idx < 0) idx += n;
			ve.push_back("MOVE");
			c++;
		}

		if (c >= 50 && s[idx % n] == 'A') break;
		co2++;
	}
	cout << ve.size() << "\n";
	for (auto u : ve) cout << u << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED