UVa455 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

题意就是找最小的循环串长度

//1.判断是否是一个周期，s[k-j] == s[k]来判断 
//2.最先找到的周期肯定最小 
//3.注意输出的格式

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;

#define maxn 100
char s[maxn];
int main()
{
    int n;
    scanf("%d",&n);

    for(int i = 0; i < n; i++)
    {
        scanf("%s",s);
        int slen = strlen(s);
        int flag = 0;
        for(int j = 1; j < slen; j++)
        {

            if(s[j] == s[0] && slen % j == 0)
            {
                int mark = 0;
                for(int k = j+1; k < slen; k++)
                {
                    if(s[k-j] != s[k])
                        {mark = 1;break;}
                }
                if(mark == 1) continue;
                else
                    {printf("%d\n",j);flag = 1;break;}
            }

        }
        if(flag == 0) printf("%d\n",slen);
        if(i != n-1) printf("\n");
    }

    return 0;
}