Project Euler #26: Reciprocal cycles
Question
Answer : 983
Hacker Rank Problem
Solution
A unit fraction contains 1 in the numerator. The decimal
representation of the unit fractions with denominators 2 to 10 are
given:
Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
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.
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
Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
Answer : 983
Hacker Rank Problem
Solution
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 | import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int t = in.nextInt(); for(int a0 = 0; a0 < t; a0++){ int n = in.nextInt(); run(n); } } public static void run(int num) { /** * observational notes note that the maximum recurring cycle length of * 1/d is d-1 */ int sequenceLength = 0; int i = 0; for (i = num; i > 1; i--) { if (sequenceLength >= i) { break; } int[] foundRemainders = new int[i]; int value = 1; int position = 0; while (foundRemainders[value] == 0 && value != 0) { foundRemainders[value] = position; value *= 10; value %= i; position++; } if (position - foundRemainders[value] > sequenceLength) { sequenceLength = position - foundRemainders[value]; } } System.out.println( sequenceLength + 1); } } |
Comments
Post a Comment