UVA455 Periodic Strings

题目描述：
Periodic Strings
A character string is said to have period k if it can be formed by concatenating one or more repetitions of another string of length k. For example, the string “abcabcabcabc” has period 3, since it is formed by 4 repetitions of the string “abc”. It also has periods 6 (two repetitions of “abcabc”) and 12 (one repetition of “abcabcabcabc”).

Write a program to read a character string and determine its smallest period.

Input

The first line oif the input file will contain a single integer N indicating how many test case that your program will test followed by a blank line. Each test case will contain a single character string of up to 80 non-blank characters. Two consecutive input will separated by a blank line.

Output

An integer denoting the smallest period of the input string for each input. Two consecutive output are separated by a blank line.

Sample Input

1

HoHoHo
Sample Output

2
题目大意：给一个字符串，求它的最小周期。略水，但要注意输出格式，没输出一个答案需要空出一行，然而最后一组数的答案输出后无需空行。

代码如下：

#include <iostream>
#include <string>
using namespace std;

int main()
{
    string s, sub;
    int n;
    cin >> n;
    while(n --) {
        cin >> s;
        sub = "";
        int l = s.length();
        for(int i = 1; i <= l; i ++) {
            if(l % i == 0) {
                sub = s.substr(0, i);
                int len = i;
                string t = sub;
                for(int j = 1; j < l / i; j ++)
                    sub += s.substr(0, i);
                if(sub == s) {
                    cout << len << endl;
                    break;
                }
            }
        }
        if(n)
            cout << endl;
    }
    return 0;
}

在网上看见其他解法，感觉很巧妙，在此给出：

#include <iostream>
#include <string>
using namespace std;

int main()
{
    string s, sub;
    int n;
    cin >> n;
    while(n --) {
        cin >> s;
        int l = s.length();
        for(int j, i = 1; i <= l; i ++) {
            if(l % i == 0) {
                for(j = i; j < l; j ++) {
                    if(s[j] != s[j % i]) {
                        break;
                    }
                }
                if(j == l) {
                    cout << i << endl;
                    break;
                }
            }
        }
        if(n)
            cout << endl;
    }
    return 0;
}