eolymp
bolt
Try our new interface for solving problems
Problems

Lexicographically smallest cyclic shift

published at 1/19/24, 3:07:26 pm

include<bits/stdc++.h>

using namespace std; int main(){ int n; cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } int idx=-1; for(int i=0;i<n;i++){ if(a[i]==1){ idx = i; break; } } for(int i=idx;i<n;i++){ cout<<a[i]<<" "; } for(int i=0;i<idx;i++){ cout<<a[i]<<" "; } }