<< problem 31 - Coin sums | Digit cancelling fractions - problem 33 >> |

# Problem 32: Pandigital products

(see projecteuler.net/problem=32)

We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n 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 9 pandigital.

*HINT:* Some products can be obtained in more than one way so be sure to only include it once in your sum.

# Algorithm

We have to solve an equation a * b = c.

There are 9!=362880 permutations of `{ 1,2,3,4,5,6,7,8,9 }`

and for each of those permutation I try all possible combinations of a, b and c.

All digits (0..9) are stored in a plain `std::vector`

and the STL's function `std::next_permutation`

generates all permutations.

Then two nested loops split the sequence into three parts (a has length `lenA`

, b has length `lenB`

and c has length `lenC`

).

If a * b = c then my program stores the product c in `std::set`

named `valid`

. Duplicates are automatically avoided by the `std::set`

.

Finally all elements of that `std::set`

are added.

## Modifications by HackerRank

The digits are 1 to n instead of 1 to 9.

## Note

There are many opportunities for optimizations but the code is already extremely fast.

# My code

… was written in C++11 and can be compiled with G++, Clang++, Visual C++. You can download it, too.

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
int main()
{
// read highest digit
unsigned int maxDigit;
std::cin >> maxDigit;
// all digits from 1..9
std::vector<unsigned int> digits = { 1,2,3,4,5,6,7,8,9 };
// remove higher numbers so there is only 1..n left
digits.resize(maxDigit);
// all pandigital products
std::set<unsigned int> valid;
// create all permutations
do
{
// let's say a * b = c
// each variable contains at least one digit
// the sum of their digits is limited by n (which should be 9)
// try all combinations of lengths with the current permutation of digits
for (unsigned int lenA = 1; lenA < maxDigit; lenA++)
for (unsigned int lenB = 1; lenB < maxDigit - lenA; lenB++)
{
unsigned int lenC = maxDigit - lenA - lenB;
// a*b=c => c>=a && c>=b => c has at least as many digits as a or b
if (lenC < lenA || lenC < lenB)
break;
// pos contains the currently used position in "digits"
unsigned int pos = 0;
// build "a" out of the first digits
unsigned int a = 0;
for (unsigned int i = 1; i <= lenA; i++)
{
a *= 10;
a += digits[pos++];
}
// next digits represent "b"
unsigned int b = 0;
for (unsigned int i = 1; i <= lenB; i++)
{
b *= 10;
b += digits[pos++];
}
// and the same for "c"
unsigned int c = 0;
for (unsigned int i = 1; i <= lenC; i++)
{
c *= 10;
c += digits[pos++];
}
// is a*b = c ?
if (a*b == c)
valid.insert(c);
}
} while (std::next_permutation(digits.begin(), digits.end()));
// find sum
unsigned int sum = 0;
for (auto x : valid)
sum += x;
std::cout << sum << std::endl;
return 0;
}

This solution contains 12 empty lines, 16 comments and 4 preprocessor commands.

# Interactive test

You can submit your own input to my program and it will be instantly processed at my server:

This is equivalent to`echo 5 | ./32`

Output:

*Note:* the original problem's input `9`

__cannot__ be entered

because just copying results is a soft skill reserved for idiots.

*(this interactive test is still under development, computations will be aborted after one second)*

# Benchmark

The correct solution to the original Project Euler problem was found in 0.05 seconds on a Intel® Core™ i7-2600K CPU @ 3.40GHz.

(compiled for x86_64 / Linux, GCC flags: `-O3 -march=native -fno-exceptions -fno-rtti -std=c++11 -DORIGINAL`

)

See here for a comparison of all solutions.

**Note:** interactive tests run on a weaker (=slower) computer. Some interactive tests are compiled without `-DORIGINAL`

.

# Changelog

February 23, 2017 submitted solution

April 6, 2017 added comments

# Hackerrank

see https://www.hackerrank.com/contests/projecteuler/challenges/euler032

My code solves **6** out of **6** test cases (score: **100%**)

# Difficulty

Project Euler ranks this problem at **5%** (out of 100%).

Hackerrank describes this problem as **easy**.

*Note:*

Hackerrank has strict execution time limits (typically 2 seconds for C++ code) and often a much wider input range than the original problem.

In my opinion, Hackerrank's modified problems are usually a lot harder to solve. As a rule thumb: brute-force is rarely an option.

# Links

projecteuler.net/thread=32 - **the** best forum on the subject (*note:* you have to submit the correct solution first)

Code in various languages:

Python: www.mathblog.dk/project-euler-32-pandigital-products/ (written by Kristian Edlund)

Haskell: github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p032.hs (written by Nayuki)

Java: github.com/nayuki/Project-Euler-solutions/blob/master/java/p032.java (written by Nayuki)

Mathematica: github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p032.mathematica (written by Nayuki)

C: github.com/eagletmt/project-euler-c/blob/master/30-39/problem32.c (written by eagletmt)

Go: github.com/frrad/project-euler/blob/master/golang/Problem032.go (written by Frederick Robinson)

Javascript: github.com/dsernst/ProjectEuler/blob/master/32 Pandigital products.js (written by David Ernst)

Scala: github.com/samskivert/euler-scala/blob/master/Euler032.scala (written by Michael Bayne)

# Heatmap

green problems solve the original Project Euler problem and have a perfect score of 100% at Hackerrank, too.

yellow problems score less than 100% at Hackerrank (but still solve the original problem).

gray problems are already solved but I haven't published my solution yet.

blue problems are solved and there wasn't a Hackerrank version of it at the time I solved it or I didn't care about it because it differed too much.

red problems are solved but exceed the time limit of one minute.

*Please click on a problem's number to open my solution to that problem:*

1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |

26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 |

51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 |

76 | 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 |

101 | 102 | 103 | 104 | 105 | 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 |

126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | 146 | 147 | 148 | 149 | 150 |

151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 |

176 | 177 | 178 | 179 | 180 | 181 | 182 | 183 | 184 | 185 | 186 | 187 | 188 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 200 |

201 | 202 | 203 | 204 | 205 | 206 | 207 | 208 | 209 | 210 | 211 | 212 | 213 | 214 | 215 | 216 | 217 | 218 | 219 | 220 | 221 | 222 | 223 | 224 | 225 |

226 | 227 | 228 | 229 | 230 | 231 | 232 | 233 | 234 | 235 | 236 | 237 | 238 | 239 | 240 | 241 | 242 | 243 | 244 | 245 | 246 | 247 | 248 | 249 | 250 |

251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | 263 | 264 | 265 | 266 | 267 | 268 | 269 | 270 | 271 | 272 | 273 | 274 | 275 |

276 | 277 | 278 | 279 | 280 | 281 | 282 | 283 | 284 | 285 | 286 | 287 | 288 | 289 | 290 | 291 | 292 | 293 | 294 | 295 | 296 | 297 | 298 | 299 | 300 |

301 | 302 | 303 | 304 | 305 | 306 | 307 | 308 | 309 | 310 | 311 | 312 | 313 | 314 | 315 | 316 | 317 | 318 | 319 | 320 | 321 | 322 | 323 | 324 | 325 |

326 | 327 | 328 | 329 | 330 | 331 | 332 | 333 | 334 | 335 | 336 | 337 | 338 | 339 | 340 | 341 | 342 | 343 | 344 | 345 | 346 | 347 | 348 | 349 | 350 |

351 | 352 | 353 | 354 | 355 | 356 | 357 | 358 | 359 | 360 | 361 | 362 | 363 | 364 | 365 | 366 | 367 | 368 | 369 | 370 | 371 | 372 | 373 | 374 | 375 |

I scored 12,626 points (out of 14300 possible points, top rank was 20 out ouf ≈60000 in July 2017) at Hackerrank's Project Euler+.

Look at my progress and performance pages to get more details.

My username at Project Euler is

**stephanbrumme**while it's stbrumme at Hackerrank.

<< problem 31 - Coin sums | Digit cancelling fractions - problem 33 >> |