forked from nduchuyvp123/CSES-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1110 - Minimal Rotation.cpp
53 lines (49 loc) · 1.31 KB
/
1110 - Minimal Rotation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
Problem Name: Minimal Rotation
Problem Link: https://cses.fi/problemset/task/1110
Author: Sachin Srivastava (mrsac7)
*/
#include<bits/stdc++.h>
using namespace std;
template<typename... T>
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {cerr << *it << "=" << a << ", "; err(++it, args...);}
#define int long long
#define F first
#define S second
const long long inf = 1LL<<62;
const int md = 1000000007;
void solve(){
string s;
cin>>s;
s+=s;
int n = s.size();
int i = 0;
int ans = 0;
while (i < n/2) {
ans = i;
int k = i, j = i + 1;
while (j < n && s[j] >= s[k]) {
if (s[j] == s[k]) k++;
if (s[j] > s[k] ) k = i;
j++;
}
while(i <= k) i += j - k;
}
cout<<s.substr(ans,n/2);
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
//cin>>t;
for (int i = 1; i <= t; i++) {
solve();
cout<<'\n';
}
}