-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuestion26.java
More file actions
52 lines (47 loc) · 1.15 KB
/
Question26.java
File metadata and controls
52 lines (47 loc) · 1.15 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
import java.util.*;
/**
*
*
* A unit fraction contains 1 in the numerator. The decimal representation of
* the unit fractions with denominators 2 to 10 are given:
*
* 1/2 = 0.5 1/3 = 0.(3) 1/4 = 0.25 1/5 = 0.2 1/6 = 0.1(6) 1/7 = 0.(142857) 1/8
* = 0.125 1/9 = 0.(1) 1/10 = 0.1
*
* Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be
* seen that 1/7 has a 6-digit recurring cycle.
*
* Find the value of d < 1000 for which 1/d contains the longest recurring cycle
* in its decimal fraction part.
*
* @author chz
*
*/
public class Question26 {
private static Set<Integer> s = new HashSet<Integer>();
private static int getFrac(int num) {
s.clear();
int tmp = 1;
while (s.add(tmp))
tmp = (tmp * 10) % num;
return s.size();
}
/**
* @param args
*/
public static void main(String[] args) {
int longest = 0, D = 1, tmp = 0, i = 0;
long start, end;
start = System.nanoTime();
for (i = 1; i <= 1000; i++) {
tmp = getFrac(i);
if (longest < tmp) {
longest = tmp;
D = i;
}
}
end = System.nanoTime();
System.out.println("get result " + D + " in " + (end - start)
+ " nano secs");
}
}