【UVa】455 - Periodic Strings

Problem here
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

Solution

#include <iostream>#include <string>using namespace std;int main(){    int kase;    cin >> kase;    while(kase--){        string line;        getline(cin, line);        bool pass = false;        string input;        cin >> input;        for(int i = 1; i <= input.size()-1; i++){            if(input.size() % i == 0){                int j;                for(j = i; j < input.size(); j++){                    if(input[j] != input[j%i])                        break;                }                if(j == input.size()){                    cout << i << endl;                    pass = true;                    break;                }            }        }        if(!pass)            cout << input.size() << endl;        if(kase)            cout << endl;    }    return 0;}