Problème
Write a multiplication a × b = c and look at all the digits in a, b and c together. The equation is n-pandigital when those digits are 1, 2, ..., n, each used exactly once (no zeros). For n = 4, 3 × 4 = 12 qualifies. Find every product c that appears in some n-pandigital equation.
Implement pandigital_products(n).
Input
n: The largest digit to use.
Output
Return the sum of the distinct products c. A product reached by more than one equation is added once. If there is none, return 0.
Contraintes
1 ≤ n ≤ 9
Exemples
Entrée :
n = 4
Sortie attendue :
expected = 12
Entrée :
long long n = 4;
Sortie attendue :
long long expected = 12;
Entrée :
long n = 4;
Sortie attendue :
long expected = 12;
Explication
3 × 4 = 12 uses 1, 2, 3, 4 once each and it is the only such equation, so the answer is 12.
Entrée :
n = 3
Sortie attendue :
expected = 0
Entrée :
long long n = 3;
Sortie attendue :
long long expected = 0;
Entrée :
long n = 3;
Sortie attendue :
long expected = 0;
Explication
With the digits 1, 2, 3 the only splits are like 1 × 2 = 3, which is false, so the answer is 0.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Every n-pandigital equation is an ordering of the digits 1 to n cut into three pieces.
Indice 2
Try every cut point pair and check whether the first two pieces multiply to the third.
Indice 3
Store products in a set so each is added once.
Complexité attendue
O(n! × n²) time, O(number of products) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.