문제
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.
제약 조건
1 ≤ n ≤ 9
예시
입력:
n = 4
예상 출력:
expected = 12
입력:
long long n = 4;
예상 출력:
long long expected = 12;
입력:
long n = 4;
예상 출력:
long expected = 12;
설명
3 × 4 = 12 uses 1, 2, 3, 4 once each and it is the only such equation, so the answer is 12.
입력:
n = 3
예상 출력:
expected = 0
입력:
long long n = 3;
예상 출력:
long long expected = 0;
입력:
long n = 3;
예상 출력:
long expected = 0;
설명
With the digits 1, 2, 3 the only splits are like 1 × 2 = 3, which is false, so the answer is 0.
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Every n-pandigital equation is an ordering of the digits 1 to n cut into three pieces.
힌트 2
Try every cut point pair and check whether the first two pieces multiply to the third.
힌트 3
Store products in a set so each is added once.
예상 복잡도
O(n! × n²) time, O(number of products) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.