Tous les défis
Moyen 0 résolus 0 % de réussite

Highly Divisible Triangular Number

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

Ce que vous allez apprendre

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

Problème

Afficher la traduction

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.

Contraintes

1 ≤ d ≤ 300

Exemples

Exemple 1
Entrée :
d = 4

Sortie attendue :
expected = 6
Entrée :
long long d = 4;

Sortie attendue :
long long expected = 6;
Entrée :
long d = 4;

Sortie attendue :
long expected = 6;

Explication

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

Exemple 2
Entrée :
d = 9

Sortie attendue :
expected = 36
Entrée :
long long d = 9;

Sortie attendue :
long long expected = 36;
Entrée :
long d = 9;

Sortie attendue :
long expected = 36;

Explication

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.

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

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

Indice 2

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

Indice 3

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

Complexité attendue

O(K √K) time for K triangular numbers tried, O(1) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.