Rotations

#include <iostream>
#include <algorithm>

using namespace std;

int n, idx; 
long long int sum, minsum;
string str;
int main() {
    cin >> str; n = str.size();
    int digit = 1;
    for (int i=n-1; i>=0; i--) {
        sum += (str[i]-'a') * digit;
        digit*=10;
    }
    minsum = sum; idx = -1;
    // cout << minsum << endl;
    for (int i = 0; i<n-1; i++) {
        
        sum = sum*10 - (str[i]-'a')*digit + (str[i]-'a');
        // cout << sum << " " << i<< endl;
        if (sum < minsum) { idx = i; minsum = sum;}
    }
    // cout << idx << endl;
    cout << str.substr(idx+1) << str.substr(0, idx+1) << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER