“阿里巴巴集团杯”ACM-ICPC校内程序设计精英赛 - 热身赛

From: 2011-04-28 09:00:00 To: 2011-04-28 21:00:00 Now: 2017-09-20 01:07:23 Status: Public

J - The Minimum Length

Time Limit: 1s Memory Limit: 128MB

Submissions: 3324 Solved: 1148
Description
There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA...... Now I cut it from two different position and get a new string B. Then, give you the string B, can you tell me the length of the shortest possible string A. For example, A="abcdefg". I got abcdefgabcdefgabcdefgabcdefg.... Then I cut the red part: efgabcdefgabcde as string B. From B, you should find out the shortest A.
Input
Multiply Test Cases. For each line there is a string B which contains only lowercase and uppercase charactors. The length of B is no more than 1,000,000.
Output
For each line, output an integer, as described above.
Sample Input
bcabcab
efgabcdefgabcde
Sample Output
3
7
Hint
Source