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>
#include<cstdio>
using namespace std;

int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        string str;
        cin>>str;
        int result;
        int len=str.length();
        for(int i=1;i<=len;i++) //周期
        {
            if(len%i!=0) //周期必须能整除字符串长度
                continue;
            int j;
            for(j=i;j<len;j++)
            {
                if(str[j]!=str[j%i]) //根据周期比较子串
                    break;
            }
            if(j==len)   //此周期的子串能循环整个串
            {
                printf("%d\n",i);
                break;

            }
        }
        if(n)
            printf("\n");
    }

    return 0;
}

转载于:https://www.cnblogs.com/YYFFstory/p/5011697.html