HDU 2609 How Many

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
using namespace std;
const int MAXN=205;
string s[10005];
int n;
void MINR(int temp){
    int i=0,j=1;int len=s[temp].length() ;
    s[temp]+=s[temp];
    while(i<len&&j<len){
        int k=0;
        while(s[temp][i+k]==s[temp][j+k]&&k<len) k++;
        if(k==len) break;
        if(s[temp][i+k]>s[temp][j+k]) i=max(i+k+1,j+1);
        else j=max(j+k+1,i+1);
    }
    int ans=min(i,j);
    s[temp].assign(s[temp],ans,len);
}
int main(){
    freopen("in.txt","r",stdin);
    while(cin>>n){
        for(int i=1;i<=n;i++){
            cin>>s[i];
            MINR(i);
            //cout<<s[i]<<endl;
        }
        sort(s+1,s+n+1);
        int ans=unique(s+1,s+n+1)-s-1;
        cout<<ans<<endl;
    }
    
    fclose(stdin);
    return 0;
}