Rotations

#include <iostream>
#include <algorithm>

using namespace std;

#define _a(_i) (s[(c[_i] + level) % n])

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	string s;
	cin >> s;
	int n = s.length();

	bool isCand[n];
	int c[n];
	for (int i=0; i<n; ++i) {
		isCand[i] = true;
		c[i] = i;
	}

	int cands = n;
	int level = 0;
	int c_it;

	while (cands > 1) {
		c_it = 0;
		char min = _a(0);
		for (int i=0; i<cands; ++i) {
			if (_a(i) < min) min = _a(i);
			//isCand[c[i]] = false;
			if (level > 0) isCand[(c[i] + level) % n] = false;
		}
		//cout << min << "\n";

		for (int i=0; i<cands; ++i) {
			//cout << "_" << _a(i) << "\n";
			if (isCand[c[i]] && _a(i) == min) {
				c[c_it] = c[i];
				++c_it;
				//cout << "__" << c[i] << "\n";
			} else {
				isCand[c[i]] = false;
			}
		}
		cands = c_it;
		++level;
	}
	//cout << c[0] << " " << c[1] << " " << c[2] << " " << c[3] << "\n";

	cout << s.substr(c[0], n-c[0]) << s.substr(0,c[0]) << "\n";
	
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN