UVA455 Periodic Strings【水题】

A character string is said to have period k if it can be formed by concatenating one or more repetitionsof another string of length k. For example, the string ”abcabcabcabc” has period 3, since it is formedby 4 repetitions of the string ”abc”. It also has periods 6 (two repetitions of ”abcabc”) and 12 (onerepetition 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 yourprogram will test followed by a blank line. Each test case will contain a single character string of upto 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 areseparated by a blank line.

Sample Input

1

HoHoHo

Sample Output

2

问题链接：UVA455 Periodic Strings

题意简述：

　　如果一个串可以由长度为k的字符串重复多次连接而得到，则称该串为k周期。本题求一个串的最小周期。

问题分析：（略）

程序说明：

　　程序中，封装了一个函数strcmplen()用于比较相同串的两个指定长度的子串，使得主函数的逻辑变得简单。

　　另外，输出格式上需要注意。题中有“Two consecutive output are separated by a blank line.”，需要小心处理。

AC的C语言程序如下：

/* UVA455 Periodic Strings */

#include <stdio.h>
#include <string.h>

#define MAXN 80

int strcmplen(char a[], int s, int t, int len)
{
    int i;

    for(i=1; i<=len; i++) {
        if(a[s] != a[t])
            return a[s] - a[t];

        s++;
        t++;
    }

    return 0;
}

int main(void)
{
    int n, len, i, j;
    char s[MAXN+1];

    scanf("%d", &n);
    while(n--) {
        scanf("%s", s);

        len = strlen(s);

        for(i=1; i<len; i++) {
            if(len % i)
                continue;

            for(j=i; j<len; j+=i)
                if(strcmplen(s, 0, j, i) != 0)
                    break;

            if(j == len)
                break;
        }

        printf("%d\n", i);
        if(n)
            printf("\n");
    }

    return 0;
}