UVA - 455 Periodic Strings

UVA - 455 Periodic Strings

题目大意。给一段字符串 然后求 该字符串最小打重复周期数

解题思路：求字符串长度 分解其约数 然后用分别用约束个数打小字符串循环对比

#include <iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    string a;
    bool b;
    int s;
    int r;
    while(n){
        int t = n;
        cin>>a;
        b = 0;
        for (int i = 0; i < a.length();i++){
            r = a.length() % (i+1);
            if (r == 0){
                for (int k = 0; k < a.length();k++){
                    b = 1;
                    if(a[k%(i+1)] != a[k]){
                        b = 0;
                        break;
                    }       
                }   
            }
            s = i + 1;
            if (b)
                break;  
        }
            cout<<s<<endl;
            n--;
            if (n)
                cout<<endl;
    }
    return 0;
}