Code/FINDSR.cpp at master · sushiljacksparrow/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

	string str;
	while(cin>>str && str!="*") {
	int n = str.size();
	int arr[n];
	arr[0] = 0;
	int len = 0;
	int i = 1;
	while(i<n)
	{
		if(str[i]==str[len])
		{
			len++;
			arr[i]=len;
			i++;
		} else
		{
			if(len!=0)
			{
				len = arr[len-1];
			} else
			{
				arr[i] = 0;
				i++;
			}
		}
	}
	//for(int i=0;i<n;i++)
	//	cout<<arr[i]<<" ";
	//cout<<endl;
	int k = 0;
	bool success = false;
	for(;k<n && !success;k++)
	{
		if(arr[k] != 0)
		{
			bool flag = true;
			int t = k;
			//cout<<"dasda\n";
			for(int i=2*k-1;i<n;i+=k)
			{
			//	cout<<k<<" "<<i<<" "<<arr[i]<<" "<<t<<endl;
				if(arr[i] != t)
					flag = false;
				t+=k;
			//	system("pause");
			}
			//cout<<flag<<" "<<k<<endl;
			if(flag == true)
			{
				int ans = n/k;
				//cout<<n<<" "<<ans<<" "<<k<<endl;
				if(ans*k == n)
				{
					cout<<ans<<endl;
					success = true;
				}
			}
		}
	}
	if(success == false)
		cout<<1<<endl;
  }
	//}


	system("pause");
}