HDU 2609 How many

解题思路:最大or最小表示法找出最大or最小，然后重组字符串，用set去重，看set.size()即可

#include <iostream>
#include <cstring>
#include <algorithm>
#include <string>
#include <set>
using namespace std;

int Len;
set<string> result;

int FindMin(string a)
{
    int i = 0, j = 1, k = 0;
    while (i < Len && j < Len && k < Len)
    {
        if (a[(i + k) % Len] == a[(j + k) % Len])
            k++;
        else if (a[(i + k) % Len] > a[(j + k) % Len])
        {
            i = i + k + 1;
            k = 0;
        }
        else
        {
            j = j + k + 1;
            k = 0;
        }
        if (i == j)
            j++;
    }

    return min(i, j);
}

int main()
{
    ios::sync_with_stdio(false);
    int cas;
    while (cin >> cas)
    {
        for (int i = 0; i < cas; ++i)
        {
            string s, temp;
            cin >> s;
            Len = s.size();
            int k = FindMin(s);
            for (int j = k; j < Len; ++j)
                temp += s[j];
            for (int j = 0; j < k; ++j)
                temp += s[j];
            result.insert(temp);
        }

        cout << result.size() << endl;
        result.clear();
    }

    return 0;
}