forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp035.java
More file actions
41 lines (30 loc) · 882 Bytes
/
p035.java
File metadata and controls
41 lines (30 loc) · 882 Bytes
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
/*
* Solution to Project Euler problem 35
* Copyright (c) Project Nayuki. All rights reserved.
*
* https://www.nayuki.io/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
public final class p035 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p035().run());
}
private static final int LIMIT = Library.pow(10, 6);
private boolean[] isPrime = Library.listPrimality(LIMIT - 1);
public String run() {
int count = 0;
for (int i = 0; i < isPrime.length; i++) {
if (isCircularPrime(i))
count++;
}
return Integer.toString(count);
}
private boolean isCircularPrime(int n) {
String s = Integer.toString(n);
for (int i = 0; i < s.length(); i++) {
if (!isPrime[Integer.parseInt(s.substring(i) + s.substring(0, i))])
return false;
}
return true;
}
}