<< problem 152 - Writing 1/2 as a sum of inverse squares | Counting Capacitor Circuits - problem 155 >> |
Problem 154: Exploring Pascal's pyramid
(see projecteuler.net/problem=154)
A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.
Then, we calculate the number of paths leading from the apex to each position:
A path starts at the apex and progresses downwards to any of the three spheres directly below the current position.
Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it
(depending on the position, there are up to three numbers above it).
The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion (x + y + z)^n.
How many coefficients in the expansion of (x + y + z)^200000 are multiples of 10^12?
My Algorithm
Wikipedia told me that a value of Pascal's pyramid can be derived from Pascal's triangle (en.wikipedia.org/wiki/Pascal's_pyramid)
P(level, i, j) = T(level, i) * T(i, j)
And a value of Pascal's triangle is computed with the binomial coefficient:
T(n, k) = dfrac{n!}{(n-k)! * k!}
Those values get huge - but I don't need to know their true value.
All I need to know is whether P(level, i, j) can be factorized into at least 12x 2 and 12x 5 because 2^12 * 5^12 = 10^12.
My program stores for each number between 1 and 200000 (= layer
) how often it contains 2 and 5 (see mulPrime1
and mulPrime2
).
Repeatedly dividing the current number by 2 and 5 produces the desired result.
Then it stores for each factorial between 1 and 200000 how often it contains 2 and 5 (see sum1
and sum2
).
Since s^x * s^y = s^{x+y} it boils down to summing the exponents up to the current point.
The same idea make choose
very simple:
choose(T(n, k)) = sums[n] - (sums[n-k] + sums[k])
When I call choose
with sums = sum1
then I know how many 2s T(n,k) contains.
And the same happens with sums = sum2
for the number of 5s.
Whenever I have at least 12x 2s and 12x 5s then I found a multiple of 10^12.
There a two simple optimizations:
- if T(level, i) is a multiple of 10^12 then any T(level, i) * T(i, j) is as well
- T(n, k) = T(n, n - k) → the pyramid is symmetric and I only need to compute its left half
Modifications by HackerRank
Hackerrank wants you to count all numbers that are multiples of p_1^{a_1} * p_2^{a_2} where p_1 and p_2 are distinct prime numbers.
10^12 = 2^12 * 5^12, therefore my program finds the correct solution for the original problem when entering 200000 2 12 5 12
.
Note
There are more symmetries in the pyramid that I didn't exploit: I can see six "areas" with identical values.
Proper use would make my program probably 3 times faster.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho "3 2 1 3 1" | ./154
Output:
Note: the original problem's input 200000 2 12 5 12
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++11 and can be compiled with G++, Clang++, Visual C++. You can download it, too.
#include <iostream>
#include <vector>
typedef std::vector<unsigned int> Exponents;
// return exponent of a prime factor of C(n,k)
// looks a bit like the logarithm:
// C(n,k) = n! / ((n-k)! * k!)
unsigned int choose(const Exponents& sums, unsigned int n, unsigned int k)
{
return sums[n] - (sums[n - k] + sums[k]);
}
int main()
{
unsigned int layer = 200000;
// 10^12 = 2^12 * 5^12
unsigned int prime1 = 2;
unsigned int exponent1 = 12;
unsigned int prime2 = 5;
unsigned int exponent2 = 12;
std::cin >> layer >> prime1 >> exponent1 >> prime2 >> exponent2;
// analyze for each number between 0 and layer how often they contain prime1 and prime2
Exponents mulPrime1 = { 0 };
Exponents mulPrime2 = { 0 };
for (unsigned int x = 1; x <= layer; x++)
{
auto current = x;
unsigned int count = 0;
// extract first prime (=2) as often as possible
while (current % prime1 == 0)
{
current /= prime1;
count++;
}
mulPrime1.push_back(count);
count = 0;
// extract second prime (=5) as often as possible
while (current % prime2 == 0)
{
current /= prime2;
count++;
}
mulPrime2.push_back(count);
}
// sum1[x] = sum of mulPrime1[0 ... x]
Exponents sum1;
unsigned int count = 0;
for (auto x : mulPrime1)
{
count += x;
sum1.push_back(count);
}
// the same stuff for the other prime
Exponents sum2;
count = 0;
for (auto x : mulPrime2)
{
count += x;
sum2.push_back(count);
}
unsigned long long result = 0;
for (unsigned int i = 0; i <= layer; i++)
{
// how often is each prime used by C(layer, i) ?
auto found1 = choose(sum1, layer, i);
auto found2 = choose(sum2, layer, i);
// already enough ?
if (found1 >= exponent1 && found2 >= exponent2)
{
// no need to enter the inner-most loop, each iteration would succeed
result += i + 1;
continue;
}
// note: abort early because of mirrored values
for (unsigned int j = 0; j <= (i+1) / 2; j++)
{
if (found1 + choose(sum1, i, j) >= exponent1 &&
found2 + choose(sum2, i, j) >= exponent2)
{
// found a match
result++;
// left and right side are identical
if (j < i / 2)
result++;
}
}
}
// and we're done !
std::cout << result << std::endl;
return 0;
}
This solution contains 11 empty lines, 16 comments and 2 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 16.5 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
Peak memory usage was about 6 MByte.
(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
July 13, 2017 submitted solution
July 13, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler154
My code solves 11 out of 21 test cases (score: 45%)
I failed 0 test cases due to wrong answers and 10 because of timeouts
Difficulty
Project Euler ranks this problem at 60% (out of 100%).
Hackerrank describes this problem as hard.
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=154 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python github.com/Meng-Gen/ProjectEuler/blob/master/154.py (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/154.cpp (written by Yuping Luo)
C++ github.com/smacke/project-euler/blob/master/cpp/154.cpp (written by Stephen Macke)
Java github.com/HaochenLiu/My-Project-Euler/blob/master/154.java (written by Haochen Liu)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem154.java (written by Magnus Solheim Thrap)
Mathematica github.com/steve98654/ProjectEuler/blob/master/154.nb
Perl github.com/shlomif/project-euler/blob/master/project-euler/154/euler-154.pl (written by Shlomi Fish)
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 | 681 | 682 | 683 | 684 | 685 | 686 | 687 |
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 152 - Writing 1/2 as a sum of inverse squares | Counting Capacitor Circuits - problem 155 >> |