字典序UVa 1584 Circular Sequence

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include<cstdlib>
#include<cstring>
#include <vector>
#include <queue>
#include <map>
using namespace std;
#define maxn 100100
//字典序
const int N = 150;
char c;
char str[105], ans[105];
int t, len;
int main() {
    cin >> t;
    while (t--) {
        cin >> str;
        len = strlen(str);
        strcpy(ans, str);
        for (int i = 0; i < len; i++) {
            c = str[len - 1];
            for (int j = len - 1; j >= 1; j--) {
                str[j] = str[j - 1];
            }
            str[0] = c;
            if (strcmp(str, ans) < 0) {
                strcpy(ans, str);
            }
        }
        printf("%s\n", ans);
    }
    return 0;
}