Description
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).
Input
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output
For each s you should print the largest n such that s = a^n for some string a.
Sample Input
abcd aaaa ababab .
Sample Output
1 43
private static final int MAX_NUMBER = 100001; private int[] next = new int[MAX_NUMBER]; private void getNext(char[] str, int len) { int i = 0; int j = -1; next[0] = j; while (i < len) { if (j == -1 || str[i] == str[j]) { ++i; ++j; next[i] = j; } else { j = next[j]; } } } public void getResult() { char[] str; Scanner scan = new Scanner(System.in); while (true) { String s = scan.nextLine(); str = s.toCharArray(); if (str[0] == '.') { break; } int len = str.length; getNext(str, len); if ((len % (len - next[len])) == 0) { System.out.println(len / (len - next[len])); } else { System.out.println(1); } } }