Rotations

#include <iostream>

using namespace std;

int n;
string s;

int gmini() {
	int i = 0;
	int j = 1;
	int k = 0;
	while (j < n) {
		for (k = 0; k < n && s[(i+k)%n] == s[(j+k)%n]; ++k);
		if (s[(i+k)%n] <= s[(j+k)%n]) {
			j += k+1;
		}
		else {
			i += k+1;
			if (i < j) {
				i = j++;
			}
			else {
				j = i+1;
			}
		}
	}
	return i;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> s;
	n = s.length();
	int sti = gmini();
	s += s;
	for (int i = sti; i < sti+n; ++i) {
		cout << s[i];
	}
	cout << "\n";
	return 0;
}

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