문제
Some unit fractions end (1/4 = 0.25) and the rest repeat forever: 1/6 = 0.1666... repeats a block of 1 digit and 1/7 = 0.142857142857... a block of 6. Among d = 2, 3, ..., limit, find the d whose 1/d has the longest repeating block. Do the long division by hand in code: the digits start repeating as soon as a remainder comes back.
Implement longest_recurring_cycle(limit).
Input
limit: The largest denominator to try.
Output
Return the d with the longest repeating block. A fraction that ends has a block length of 0. If several d tie, return the smallest.
제약 조건
2 ≤ limit ≤ 2000
예시
입력:
limit = 8
예상 출력:
expected = 7
입력:
long long limit = 8;
예상 출력:
long long expected = 7;
입력:
long limit = 8;
예상 출력:
long expected = 7;
설명
Block lengths for 2 to 8 are 0, 1, 0, 0, 1, 6, 0, so the answer is 7.
입력:
limit = 5
예상 출력:
expected = 3
입력:
long long limit = 5;
예상 출력:
long long expected = 3;
입력:
long limit = 5;
예상 출력:
long expected = 3;
설명
1/3 repeats one digit, 1/2, 1/4 and 1/5 end, so the answer is 3.
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Each new digit of 1/d comes from the remainder times 10.
힌트 2
Remember the step where each remainder first appeared.
힌트 3
If the remainder becomes 0 the decimal ends; otherwise the cycle length is the gap between two visits of the same remainder.
예상 복잡도
O(limit²) time, O(limit) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.