UVA-1585(Periodic Strings)
解题思路
用 1 到字符串的长度一一枚举,一直到可以为该字符串的周期即为该字符串的最小周期。
代码
#include <iostream>
#include <stdlib.h>
#include <cstdio>
using namespace std;
char score[20][80];
int main (){
int i,j,n;
int tem = 0,sum[20];
for (i = 0; i < 20; i++)
sum[i] = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >>score[i];
for (i = 0; i < n; i++){
for (j = 0; score[i][j] != '\0'; j++){
if (score[i][j] == 'O'){
tem++;
sum[i] += tem;
}
if (score[i][j] == 'X')
tem = 0;
}
tem = 0;
}
for (i = 0; i<n ;i++)
if (i != n-1)
cout << sum[i] <<endl;
else
cout << sum[i];
return 0;
}