Codeforces Round #385 (Div. 2) A. Hongcow Learns the Cyclic Shift 水题

A. Hongcow Learns the Cyclic Shift

题目连接：

http://codeforces.com/contest/745/problem/A

Description

Hongcow is learning to spell! One day, his teacher gives him a word that he needs to learn to spell. Being a dutiful student, he immediately learns how to spell the word.

Hongcow has decided to try to make new words from this one. He starts by taking the word he just learned how to spell, and moves the last character of the word to the beginning of the word. He calls this a cyclic shift. He can apply cyclic shift many times. For example, consecutively applying cyclic shift operation to the word "abracadabra" Hongcow will get words "aabracadabr", "raabracadab" and so on.

Hongcow is now wondering how many distinct words he can generate by doing the cyclic shift arbitrarily many times. The initial string is also counted.

Input

The first line of input will be a single string s (1 ≤ |s| ≤ 50), the word Hongcow initially learns how to spell. The string s consists only of lowercase English letters ('a'–'z').

Output

Output a single integer equal to the number of distinct strings that Hongcow can obtain by applying the cyclic shift arbitrarily many times to the given string.

Sample Input

abcd

Sample Output

4

Hint

题意

给你一个环形字符串，问里面有多少个长度为n的不同字符串。

题解：

数据范围大一点的话，就是智障后缀数组题。

至于这道题数据范围这么小…… 随便搞一搞就好了

代码

#include<bits/stdc++.h>
using namespace std;

string s;
set<string>S;
int main()
{
	cin>>s;int len = s.size();
	for(int i=0;i<len;i++)
		s+=s[i];
	for(int i=0;i<len;i++){
		string tmp;
		for(int j=0;j<len;j++)
			tmp+=s[i+j];
		S.insert(tmp);
	}
	cout<<S.size()<<endl;
}