-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTask_17.java
41 lines (37 loc) · 1.15 KB
/
Task_17.java
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
package Task_acmp;
import java.util.Scanner;
public class Task_17 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int qualityNumber = sc.nextInt();
int[] masNumberArrow = new int[qualityNumber];
int[] prefixFunction = new int[qualityNumber + 1];
for (int i = 0; i < qualityNumber; i++) {
masNumberArrow[i] = sc.nextInt();
prefixFunction[i] = 0;
}
int leng = 0;
for (int i = 1; i < qualityNumber; i++) {
while (true) {
if (masNumberArrow[leng] == masNumberArrow[i]) {
leng++;
break;
}
if (leng == 0) {
break;
}
leng = prefixFunction[leng];
}
prefixFunction[i + 1] = leng;
}
while (true) {
int period = qualityNumber - leng;
if ((qualityNumber - 1) % period == 0) {
System.out.println(period);
return;
} else {
leng = prefixFunction[leng];
}
}
}
}