Ultraviolet A 455-periodic strings

Question: Find the minimum cyclic section of a string.

Analysis: brute force, String. If the data volume is small, use the enumeration method directly.

Enumerate the length of the cyclic section, match and judge, find the first group of solutions to be the minimum.

Note: (⊙ _ ⊙ ).

# Include <iostream> # include <cstdlib> # include <cstring> # include <cstdio> using namespace STD; char STR [104]; int main () {int N; while (~ Scanf ("% d", & N) while (n --) {scanf ("% s", STR); int Len = strlen (STR); For (int K, I = 1; I <= Len; ++ I) if (LEN % I = 0) {for (k = I; k <Len; ++ K) if (STR [k]! = STR [K % I]) break; If (k = Len) {printf ("% d \ n", I); break ;}} if (N) printf ("\ n");} return 0 ;}

Ultraviolet A 455-periodic strings