字符串周期

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

上边是题面

字符串的周期 被字符串的长度%后为0；

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
 int t;
 cin>>t;
 for(int k=1;k<=t;k++)
 {
  if(k!=1)cout<<endl;
  string s;
 cin>>s;
 int i,j;
 int len=s.length();
 for(i=1;i<=len;i++)
 {
  if(len%i==0)
  for( j=1;j<len;j++)
  {
   if(s[j]!=s[j%i])break;
  }
  if(j==len)break;
 }
 printf("%d\n",i);
 }
 
 return 0;
 
}