Tutte le sfide
Media 0 risolte 0% di accettazione

Highly Divisible Triangular Number

Find the first triangular number that has at least d divisors.

Cosa imparerai

  • Count divisors from a prime factorization
  • Use the formula for triangular numbers
  • Split a product of coprime factors

Problema

Mostra traduzione

Triangular numbers count the dots in a triangle of rows 1, 2, 3, ...: T(1) = 1, T(2) = 3, T(3) = 6, and T(k) = k(k + 1) / 2. Walk through them in order and stop at the first one with at least d positive divisors (1 and the number itself count).

Implement highly_divisible_triangular(d).

Counting divisors one by one is too slow for the larger cases. Factor the number instead: if n = p^a × q^b × ..., it has (a + 1)(b + 1)... divisors. Since k and k + 1 share no factor, you can factor them separately.

Input

d: The number of divisors needed.

Output

Return the first triangular number with at least d divisors.

Vincoli

1 ≤ d ≤ 300

Esempi

Esempio 1
Input:
d = 4

Output atteso:
expected = 6
Input:
long long d = 4;

Output atteso:
long long expected = 6;
Input:
long d = 4;

Output atteso:
long expected = 6;

Spiegazione

1 has one divisor and 3 has two, but 6 has four (1, 2, 3, 6), so the answer is 6.

Esempio 2
Input:
d = 9

Output atteso:
expected = 36
Input:
long long d = 9;

Output atteso:
long long expected = 36;
Input:
long d = 9;

Output atteso:
long expected = 36;

Spiegazione

28 has six divisors and 36 = 2² × 3² has 3 × 3 = 9 (1, 2, 3, 4, 6, 9, 12, 18, 36), so the answer is 36.

Come affrontarlo

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

Suggerimento 1

T(k) = k(k + 1) / 2, and k and k + 1 have no common factor.

Suggerimento 2

Halve whichever of k and k + 1 is even, then count the divisors of each part.

Suggerimento 3

The divisor count of a product of coprime numbers is the product of their counts.

Complessità attesa

O(K √K) time for K triangular numbers tried, O(1) 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.