Tutte le sfide
Difficile 0 risolte 0% di accettazione

Digit Factorial Chains

Count starting numbers whose digit factorial chain has exactly a given number of distinct terms.

Cosa imparerai

  • Follow a chain until a value repeats
  • Find chain lengths inside and before a loop
  • Reuse stored lengths

Problema

Mostra traduzione

Replace a number by the sum of the factorials of its digits: 145 gives 1! + 4! + 5! = 145 again, and 69 gives 6! + 9! = 363600. Repeating this always falls into a loop. The chain of a start is its terms until the first repeat: 69, 363600, 1454, 169, 363601 and then 1454 again, so 69 has 5 distinct terms. Count the starting numbers from 1 to limit whose chain has exactly length distinct terms.

Implement digit_factorial_chains(limit, length).

Many chains run into the same numbers. Store each number's chain length once it is known and reuse it.

Input

limit: The largest starting number.

length: The number of distinct terms wanted, the start included.

Output

Return how many starting numbers n with 1 ≤ n ≤ limit have exactly length distinct terms in their chain.

Vincoli

1 ≤ limit ≤ 100,000; 1 ≤ length ≤ 70

Esempi

Esempio 1
Input:
limit = 2
length = 1

Output atteso:
expected = 2
Input:
long long limit = 2;
long long length = 1;

Output atteso:
long long expected = 2;
Input:
long limit = 2;
long length = 1;

Output atteso:
long expected = 2;

Spiegazione

1! = 1 and 2! = 2, so 1 and 2 each map to themselves and have a chain of 1 term. The answer is 2.

Esempio 2
Input:
limit = 10
length = 2

Output atteso:
expected = 1
Input:
long long limit = 10;
long long length = 2;

Output atteso:
long long expected = 1;
Input:
long limit = 10;
long length = 2;

Output atteso:
long expected = 1;

Spiegazione

3 gives 6, then 720, 5043, ... so it is long. 10 gives 1! + 0! = 2 and then 2 again: two terms. Only 10 has exactly 2, so the answer is 1.

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

Precompute 0! to 9! once.

Suggerimento 2

Record each value's step number in the current chain; a repeat tells you where the loop starts.

Suggerimento 3

Values in the loop all have the loop's length, and each value before it has one more than the next.

Complessità attesa

O(limit × log limit) time with memoization, O(limit) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.