-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathproblem35.java
More file actions
63 lines (48 loc) · 1.4 KB
/
Copy pathproblem35.java
File metadata and controls
63 lines (48 loc) · 1.4 KB
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
import java.util.ArrayList;
public class problem35 {
public static boolean isPrime(int num) {
int limit = new Double(Math.sqrt(num) + 1).intValue();
for (long i = 2; i < limit; i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
public static String rotate(String num, Integer numSize) {
String rotated;
if (numSize == 1) {
return num;
}
// Rotate array
rotated = num.substring(1, numSize) + num.charAt(0);
return rotated;
}
public static void main(String args[]) {
Integer limit = 1000000,
counter = 0,
numLength;
String test;
boolean prime = false;
// Loop through numbers
for (int i = 2; i < limit; i++) {
test = Integer.toString(i);
numLength = test.length();
// Loop through rotations
for (int j = 0; j < numLength; j++) {
if (isPrime(Integer.parseInt(test))) {
test = rotate(test, numLength);
prime = true;
}
else {
prime = false;
break;
}
}
if (prime) {
counter += 1;
}
}
System.out.println("Answer found: " + counter);
}
}