这道题是暴力过的。等必须用suffix array或者KMP的时候再看吧。。。
2406 | Accepted | 2744K | 266MS | G++ | 996B |
/*
ID: thestor1
LANG: C++
TASK: poj2406
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>
using namespace std;
bool find(string &s, int k, string &sub)
{
for (int i = 0; i < sub.size(); ++i)
{
if (s[k + i] != sub[i])
{
return false;
}
}
return true;
}
int main()
{
std::ios::sync_with_stdio(false);
string s, sub;
while (cin >> s && s != ".")
{
sub = "";
sub.push_back(s[0]);
int i;
for (i = 1; i < s.size(); ++i)
{
int k = sub.size();
if (s.size() % k == 0)
{
while (k < s.size() && find(s, k, sub))
{
k += sub.size();
}
if (k == s.size())
{
break;
}
}
sub.push_back(s[i]);
}
cout << s.size() / i << endl;
}
return 0;
}