Rotations

input/code.cpp: In function 'bool better(std::__cxx11::string, int, int)':
input/code.cpp:25:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(k < s.size() && s[(i + k) % s.size()] == s[(j + k) % s.size()]) k++;
           ~~^~~~~~~~~~
input/code.cpp: In function 'int gen(int*, std::__cxx11::string)':
input/code.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < s.size(); i++) {
                    ~~^~~~~~~~~~
input/code.cpp:31:9: warning: unused variable 'n' [-Wunused-variable]
     int n = s.size();
         ^
input/code.cpp: In function 'int main()':
input/code.cpp:62:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 1; i < s.size(); i++)
                        ~~^~~~~~~~~~
input/code.cpp:72:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i < s....

#include <vector>
#include <iostream>
#include <string>


using namespace std;

int sum(int *d) {
    int s = 0;
    for(int i = 0; i < 10; i++)  s+= d[i];
    return s;
}

void print(string s, int a) {
    int n = s.size();
    for(int i = a; i < n; i++)
        cout << s[i];
    for(int i = 0; i < a; i++)
        cout << s[i];
    cout << endl;
}

bool better(string s, int i, int j) {
    int k = 0;
    while(k < s.size() && s[(i + k) % s.size()] == s[(j + k) % s.size()]) k++; 
    return s[i] < s[j];
}

int gen(int *a, string s) {
    int min = 1 << 30;
    int n = s.size();
    int d[10];
    int t = 1;
    for(int i = 0; i < 10; i++) {
        d[9 - i] = s[9 - i]*t;
        t *= 10;
    }
    for(int i = 0; i < s.size(); i++) {
        int m = sum(d);

        a[i] = m;
        if(m < min) min = m;

        for(int j = 0; j < 9; j++) {
            d[j] = d[j + 1]*10;
        }
        d[9] = s[(i + 10) % s.size()];
    }

    return min;
}


int main() {
    string s;
    cin >> s;
    int n = s.size();


    if (n < 100) {
        int b = 0;
        for(int i = 1; i < s.size(); i++)
            if(better(s, i, b)) b = i;
        print(s, b);
        return 0;
    }

    int *hs = new int[s.size()];
    int m = gen(hs, s);

    int b = 0;
    for(int i = 1; i < s.size(); i++) {
        if(hs[i] != m) continue;
        if(better(s, i, b)) b = i;
    }
    print(s, b);
    return 0;

    return 0;
}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED