【HDOJ】2609 How many

循环同构的最小表示法。

 #include <cstdio>
 #include <cstring>

 #define MAXN 10005
 #define MAXL 105

 char map[MAXN][MAXL];
 char buf[MAXL];

 int Min_exp(char str[], int len) {
     int i=, j=, k=;
     char tmp;

     while (i<len && j<len && k<len) {
         tmp = str[(i+k)%len] - str[(j+k)%len];
         if (tmp == ) {
             ++k;
         } else {
             if (tmp > )
                 i += k+;
             else
                 j += k+;
             if (i == j)
                 ++j;
             k = ;
         }
     }

     return i<j ? i:j;
 }

 int main() {
     int n, m, len;
     int i, j, k;

     while (scanf("%d", &n) != EOF) {
         m = ;
         while (n--) {
             scanf("%s", buf);
             len = strlen(buf);
             k = Min_exp(buf, len);
             j = ;
             for (i=k; i<len; ++i)
                 map[m][j++] = buf[i];
             for (i=; i<k; ++i)
                 map[m][j++] = buf[i];
             map[m][j] = '\0';
             ++m;
         }
         n = ;
         for (i=; i<m; ++i) {
             k = ;
             for (j=; j<i; ++j) {
                 if (strcmp(map[i], map[j]) == ) {
                     k = ;
                     break;
                 }
             }
             if (k)
                 ++n;
         }
         printf("%d\n", n);
     }

     return ;
 }