<< problem 73 - Counting fractions in a range | Singular integer right triangles - problem 75 >> |
Problem 74: Digit factorial chains
(see projecteuler.net/problem=74)
The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:
1! + 4! + 5! = 1 + 24 + 120 = 145
Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:
169 → 363601 → 1454 → 169
871 → 45361 → 871
872 → 45362 → 872
It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,
69 → 363600 → 1454 → 169 → 363601 (→ 1454)
78 → 45360 → 871 → 45361 (→ 871)
540 → 145 (→ 145)
Starting with 69 produces a chain of five non-repeating terms, but the longest non-repeating chain with a starting number below one million is sixty terms.
How many chains, with a starting number below one million, contain exactly sixty non-repeating terms?
My Algorithm
A function named fingerprintFactorial
counts the number of digits. It's very similar to fingerprint
from problem 49, problem 52 and problem 62.
Numbers with the same fingerprint are permutations of each other. The sum of the factorials of their digits will be the same.
This allows for a minor tweak: 0! = 1! = 1. Therefore fingerprintFactorial
treats each 1 as a 0.
Whenever the length of a loop has to be determined, the std::vector
named loop
is filled with the factorial sums until we encounter one for the second time.
cache
remembers all loop lengths indexed by their starting number. That cache is important to speed up Hackerrank repeated test cases.
Some numbers "don't fit" into my scheme: those linking back to themselves don't report the correct loop length (they are off-by-one).
That's why I manually adjust the result for those. All such "execeptional numbers" can be found in the problem statement:
145, 169, 871, 872, 1454, 45361, 45362 and 363601
Modifications by HackerRank
I have to print the starting number of such loops (not just count them).
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This live test is based on the Hackerrank problem.
This is equivalent toecho "1 200 1" | ./74
Output:
Note: the original problem's input 1000000 60
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)
My code
… was written in C++ and can be compiled with G++, Clang++, Visual C++. You can download it, too.
The code contains #ifdef
s to switch between the original problem and the Hackerrank version.
Enable #ifdef ORIGINAL
to produce the result for the original problem (default setting for most problems).
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
// count digits, two numbers have the same fingerprint if they are permutations of each other
unsigned long long fingerprintFactorial(unsigned int x)
{
unsigned long long result = 0;
while (x > 0)
{
unsigned int digit = x % 10;
x /= 10;
// small optimization: 0! = 1!
if (digit == 1)
digit = 0;
// find the right location of the digit's counter
unsigned long long shift = 1;
for (unsigned int i = 0; i < digit; i++)
shift *= 10;
result += shift;
}
return result;
}
int main()
{
// known loop-sizes
// [first number] => [loop size]
std::map<unsigned long long, unsigned int> cache;
// special treatment for those numbers that link back to themselves
// and are encountered before any other number of the same fingerprint
cache[fingerprintFactorial(145)] = 1 + 1;
cache[fingerprintFactorial(169)] = 3 + 1;
unsigned int tests = 1;
std::cin >> tests;
while (tests--)
{
unsigned int limit = 1000000;
unsigned int loopLength = 60;
std::cin >> limit >> loopLength;
// count numbers with a certain loop length
unsigned int result = 0;
for (unsigned int i = 0; i <= limit; i++)
{
// determine loop length only for unknown fingerprints
unsigned long long id = fingerprintFactorial(i);
if (cache.count(id) == 0)
{
// all numbers of the current loop
std::vector<unsigned int> loop;
// add current number to loop, abort if insert fails (because element already exists)
unsigned int x = i;
while (std::find(loop.begin(), loop.end(), x) == loop.end() && loop.size() <= loopLength)
{
loop.push_back(x);
// compute factorial sum of digits
unsigned int facSum = 0;
do
{
// factorials 0! ... 9!
const unsigned int fac[10] = { 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880 };
// add factorial of right-most digit
facSum += fac[x % 10];
// shift all digits to the right by one
x /= 10;
} while (x > 0);
x = facSum;
}
// remember that loop length (for all upcoming permutations)
cache[id] = loop.size();
}
// now the loop length is available at cache[id]
// correct loop length ?
bool match = (cache[id] == loopLength);
// special treatment for those numbers that link back to themselves
// (false negatives and positives) => relevant only for Hackerrank
if (i == 145)
match = (loopLength == 1);
if (i == 169 || i == 1454 || i == 363601)
match = (loopLength == 3);
if (i == 871 || i == 872 || i == 45361 || i == 45362)
match = (loopLength == 2);
// count matches
if (match)
result++;
//#define ORIGINAL
#ifndef ORIGINAL
if (match)
std::cout << i << " ";
#endif
}
#ifdef ORIGINAL
std::cout << result << std::endl;
#else
if (result == 0)
std::cout << "-1";
std::cout << std::endl;
#endif
}
}
This solution contains 18 empty lines, 22 comments and 9 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.16 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
(compiled for x86_64 / Linux, GCC flags: -O3 -march=native -fno-exceptions -fno-rtti -std=gnu++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
March 12, 2017 submitted solution
April 27, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler074
My code solves 7 out of 7 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 15% (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=74 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
C# www.mathblog.dk/project-euler-74-determine-the-number-of-factorial-chains-that-contain-exactly-sixty-non-repeating-terms/ (written by Kristian Edlund)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-074.py (written by Hugh Brown)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p074.py (written by Nayuki)
Python github.com/smacke/project-euler/blob/master/python/74.py (written by Stephen Macke)
C++ github.com/HaochenLiu/My-Project-Euler/blob/master/074.cpp (written by Haochen Liu)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/74.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/74.cpp (written by Yuping Luo)
C++ github.com/zmwangx/Project-Euler/blob/master/074/074.cpp (written by Zhiming Wang)
Java github.com/dcrousso/ProjectEuler/blob/master/PE074.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p074.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem74.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem074.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/074.nb
Clojure github.com/guillaume-nargeot/project-euler-clojure/blob/master/src/project_euler/problem_074.clj (written by Guillaume Nargeot)
Clojure github.com/rm-hull/project-euler/blob/master/src/euler074.clj (written by Richard Hull)
Scala github.com/samskivert/euler-scala/blob/master/Euler074.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/074-Digit-factorial-chains.pl (written by Gustaf Erikson)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p074.rs
Those links are just an unordered selection of source code I found with a semi-automatic search script on Google/Bing/GitHub/whatever.
You will probably stumble upon better solutions when searching on your own.
Maybe not all linked resources produce the correct result and/or exceed time/memory limits.
Heatmap
Please click on a problem's number to open my solution to that problem:
green | solutions solve the original Project Euler problem and have a perfect score of 100% at Hackerrank, too | |
yellow | solutions score less than 100% at Hackerrank (but still solve the original problem easily) | |
gray | problems are already solved but I haven't published my solution yet | |
blue | solutions are relevant for Project Euler only: there wasn't a Hackerrank version of it (at the time I solved it) or it differed too much | |
orange | problems are solved but exceed the time limit of one minute or the memory limit of 256 MByte | |
red | problems are not solved yet but I wrote a simulation to approximate the result or verified at least the given example - usually I sketched a few ideas, too | |
black | problems are solved but access to the solution is blocked for a few days until the next problem is published | |
[new] | the flashing problem is the one I solved most recently |
I stopped working on Project Euler problems around the time they released 617.
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 |
376 | 377 | 378 | 379 | 380 | 381 | 382 | 383 | 384 | 385 | 386 | 387 | 388 | 389 | 390 | 391 | 392 | 393 | 394 | 395 | 396 | 397 | 398 | 399 | 400 |
401 | 402 | 403 | 404 | 405 | 406 | 407 | 408 | 409 | 410 | 411 | 412 | 413 | 414 | 415 | 416 | 417 | 418 | 419 | 420 | 421 | 422 | 423 | 424 | 425 |
426 | 427 | 428 | 429 | 430 | 431 | 432 | 433 | 434 | 435 | 436 | 437 | 438 | 439 | 440 | 441 | 442 | 443 | 444 | 445 | 446 | 447 | 448 | 449 | 450 |
451 | 452 | 453 | 454 | 455 | 456 | 457 | 458 | 459 | 460 | 461 | 462 | 463 | 464 | 465 | 466 | 467 | 468 | 469 | 470 | 471 | 472 | 473 | 474 | 475 |
476 | 477 | 478 | 479 | 480 | 481 | 482 | 483 | 484 | 485 | 486 | 487 | 488 | 489 | 490 | 491 | 492 | 493 | 494 | 495 | 496 | 497 | 498 | 499 | 500 |
501 | 502 | 503 | 504 | 505 | 506 | 507 | 508 | 509 | 510 | 511 | 512 | 513 | 514 | 515 | 516 | 517 | 518 | 519 | 520 | 521 | 522 | 523 | 524 | 525 |
526 | 527 | 528 | 529 | 530 | 531 | 532 | 533 | 534 | 535 | 536 | 537 | 538 | 539 | 540 | 541 | 542 | 543 | 544 | 545 | 546 | 547 | 548 | 549 | 550 |
551 | 552 | 553 | 554 | 555 | 556 | 557 | 558 | 559 | 560 | 561 | 562 | 563 | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | 574 | 575 |
576 | 577 | 578 | 579 | 580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 | 590 | 591 | 592 | 593 | 594 | 595 | 596 | 597 | 598 | 599 | 600 |
601 | 602 | 603 | 604 | 605 | 606 | 607 | 608 | 609 | 610 | 611 | 612 | 613 | 614 | 615 | 616 | 617 | 618 | 619 | 620 | 621 | 622 | 623 | 624 | 625 |
626 | 627 | 628 | 629 | 630 | 631 | 632 | 633 | 634 | 635 | 636 | 637 | 638 | 639 | 640 | 641 | 642 | 643 | 644 | 645 | 646 | 647 | 648 | 649 | 650 |
651 | 652 | 653 | 654 | 655 | 656 | 657 | 658 | 659 | 660 | 661 | 662 | 663 | 664 | 665 | 666 | 667 | 668 | 669 | 670 | 671 | 672 | 673 | 674 | 675 |
676 | 677 | 678 | 679 | 680 |
I scored 13526 points (out of 15700 possible points, top rank was 17 out of ≈60000 in August 2017) at Hackerrank's Project Euler+.
My username at Project Euler is stephanbrumme while it's stbrumme at Hackerrank.
Look at my progress and performance pages to get more details.
Copyright
I hope you enjoy my code and learn something - or give me feedback how I can improve my solutions.
All of my solutions can be used for any purpose and I am in no way liable for any damages caused.
You can even remove my name and claim it's yours. But then you shall burn in hell.
The problems and most of the problems' images were created by Project Euler.
Thanks for all their endless effort !!!
<< problem 73 - Counting fractions in a range | Singular integer right triangles - problem 75 >> |