Problème
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.
Contraintes
2 ≤ limit ≤ 2000
Exemples
Entrée :
limit = 8
Sortie attendue :
expected = 7
Entrée :
long long limit = 8;
Sortie attendue :
long long expected = 7;
Entrée :
long limit = 8;
Sortie attendue :
long expected = 7;
Explication
Block lengths for 2 to 8 are 0, 1, 0, 0, 1, 6, 0, so the answer is 7.
Entrée :
limit = 5
Sortie attendue :
expected = 3
Entrée :
long long limit = 5;
Sortie attendue :
long long expected = 3;
Entrée :
long limit = 5;
Sortie attendue :
long expected = 3;
Explication
1/3 repeats one digit, 1/2, 1/4 and 1/5 end, so the answer is 3.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Each new digit of 1/d comes from the remainder times 10.
Indice 2
Remember the step where each remainder first appeared.
Indice 3
If the remainder becomes 0 the decimal ends; otherwise the cycle length is the gap between two visits of the same remainder.
Complexité attendue
O(limit²) time, O(limit) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.