We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- All Contests
- ProjectEuler+
- Project Euler #32: Pandigital products
Project Euler #32: Pandigital products
Project Euler #32: Pandigital products
Contest ends in
This problem is a programming version of Problem 32 from projecteuler.net
We shall say that an -digit number is pandigital if it makes use of all the digits to exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through pandigital.
HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
Input Format
Input contains an integer
Constraints
Output Format
Print the answer corresponding to the test case.
Sample Input
4
Sample Output
12