<< problem 52 - Permuted multiples | Poker hands - problem 54 >> |
Problem 53: Combinatoric selections
(see projecteuler.net/problem=53)
There are exactly ten ways of selecting three from five, 12345:
123, 124, 125, 134, 135, 145, 234, 235, 245, and 345
In combinatorics, we use the notation, ^5C_3 = 10.
In general,
^nC_r = dfrac{n!}{r! * (n-r)!} where r <= n, n! = n * (n-1) * ... * 3 * 2 * 1, and 0! = 1.
It is not until n = 23, that a value exceeds one-million: ^{23}C_10 = 1144066.
How many, not necessarily distinct, values of ^nC_r, for 1 <= n <= 100, are greater than one-million?
My Algorithm
The formulas based on factorials (those provided in the problem statement) allow a direct computation of ^nC_r.
However, you might get very big numbers in the numerator and/or denominator - they easily exceed the range of a 32 or 64 bit integer.
There is another formula - the recursive definition:
- ^nC_0 = {^nC_n} = 1 and
- ^nC_k = {^{n-1}C_{k-1}} + {^{n-1}C_k}
maxNumber
, I set it to maxNumber + 1
. This value still fits into an 64 bit integer (even 2*(maxNumber+1)
is no problem).At the same time,
bigNumbers
is incremented.I am allowed to replace ^nC_k by
maxNumber + 1
because the true value of ^nC_k doesn't really matter - all we want to know is whether ^nC_k > maxNumber - or not.When all values are processed,
bigNumbers
is displayed.
Note
The program could use less memory: instead of storing all values of combinations[n][k]
it is sufficient to keep only
combinations[n-1][]
and combinations[n][]
, thus reducing the memory requirements from maxN^2 to 2*maxN.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho "23 1000000" | ./53
Output:
(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 <vector>
#include <iostream>
int main()
{
// maximum index n and/or k
unsigned int maxN = 100;
// what is considered "big" ?
unsigned long long maxNumber = 1000000;
std::cin >> maxN >> maxNumber;
// this will be the displayed result
unsigned int bigNumbers = 0;
// setup a 2D array to hold all values
std::vector<std::vector<unsigned long long>> combinations(maxN + 1);
// C(n,0) = C(n,n) = 1
for (unsigned int n = 0; n <= maxN; n++)
{
combinations[n].resize(n + 1, 0);
combinations[n][0] = combinations[n][n] = 1;
}
// recursive definition:
// C(n,k) = C(n-1, k-1) + C(n-1, k)
for (unsigned int n = 1; n <= maxN; n++)
for (unsigned int k = 1; k < n; k++)
{
auto sum = combinations[n - 1][k - 1] + combinations[n - 1][k];
// clamp numbers to avoid exceeding 64 bits
if (sum > maxNumber)
{
sum = maxNumber + 1;
// we found one more big number
bigNumbers++;
}
// store result
combinations[n][k] = sum;
}
std::cout << bigNumbers << std::endl;
return 0;
}
This solution contains 7 empty lines, 10 comments and 2 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in less than 0.01 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
February 27, 2017 submitted solution
April 20, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler053
My code solves 5 out of 5 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=53 - 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-53-cnr-exceed-one-million/ (written by Kristian Edlund)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-053.py (written by Hugh Brown)
Python github.com/Meng-Gen/ProjectEuler/blob/master/53.py (written by Meng-Gen Tsai)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p053.py (written by Nayuki)
Python github.com/sefakilic/euler/blob/master/python/euler053.py (written by Sefa Kilic)
C++ github.com/HaochenLiu/My-Project-Euler/blob/master/053.cpp (written by Haochen Liu)
Java github.com/dcrousso/ProjectEuler/blob/master/PE053.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p053.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem53.java (written by Magnus Solheim Thrap)
Javascript github.com/dsernst/ProjectEuler/blob/master/53 Combinatoric selections.js (written by David Ernst)
Go github.com/frrad/project-euler/blob/master/golang/Problem053.go (written by Frederick Robinson)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p053.mathematica (written by Nayuki)
Mathematica github.com/steve98654/ProjectEuler/blob/master/053.nb
Haskell github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p053.hs (written by Nayuki)
Haskell github.com/roosephu/project-euler/blob/master/53.hs (written by Yuping Luo)
Clojure github.com/rm-hull/project-euler/blob/master/src/euler053.clj (written by Richard Hull)
Scala github.com/samskivert/euler-scala/blob/master/Euler053.scala (written by Michael Bayne)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p053.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 |
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 |
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 52 - Permuted multiples | Poker hands - problem 54 >> |