UVa-455 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

这题做了好久发现想复杂了。用一个变量 i 从 1 开始遍历所有可能的周期的情况，然后用一个变量 k 作数组下标遍历 除第一个周期外 后面的字符串， 每次检查是否相等， s[k%i] 是 s[k] 应该对应的一个周期中的元素。

代码如下：

#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    int t;
    char s[85];
    scanf("%d", &t);
    while(t--){
        scanf("%s", s);
        int k;
        int len = strlen(s);
        for(int i = 1; i <= len; i++){    //变量 i 从 1 开始遍历所有可能的周期
            if(len % i == 0){
                for(k = i; k < len; k++)  // k 用来遍历字符串数组
                    if(s[k] != s[k%i])    // s[k % i] 是当前假定的一个周期中的元素 
                        break;
                if(k == len){
                    printf("%d\n", i);
                    break;
                }
            }
        }
        if(t) printf("\n");
    }
    return 0;
}