1010 - The Minimum Length
Time Limit : 1 Second
Memory Limit : 128 MB
Submission: 3364
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