<< problem 287 - Quadtree encoding (a simple compression algorithm) | Digital Signature - problem 290 >> |
Problem 288: An enormous factorial
(see projecteuler.net/problem=288)
For any prime p the number N(p,q) is defined by N(p,q) = sum_{n=0 ... q}{T_n * p^n}
with T_n generated by the following random number generator:
S_0 = 290797
S_{n+1} = S_n^2 mod 50515093
T_n = S_n mod p
Let Nfac(p,q) be the factorial of N(p,q).
Let NF(p,q) be the number of factors p in Nfac(p,q).
You are given that NF(3,10000) mod 3^20 = 624955285.
Find NF(61, 10^7) mod 61^10
My Algorithm
I started with the easy part:
The function countFactors()
returns the exponent of a given prime in a factorial's prime factorization.
It relies on Legendre's formula which I already used for other problems, too ( see en.wikipedia.org/wiki/Legendre's_formula).
The pseudo-random number generator wasn't hard as well. I wrote that stuff when I saw the problem for the first time but then I was stuck and continued with other problems.
Upen revisiting this problem I made the crucial observation that the result has to be printed mod 61^10 → and 61 is the same prime used for NF(61, 10^7).
(the same hold true for the example NF(3, 10000) mod 3^20).
Therefore the result depends on three parameters:
- a prime p = 61
- a positive number q = 10^7
- an exponent of the modulus exponent = 10
It can't exceed 61^10 because of the mod 61^10 part in the final formula. The variable
maxPower
will be 1, 61, 3721, ... until it reaches 61^10 and remains at the level.There are only 61 possible values for T_n = S_n mod 61. That means that the number of different T_n * p^n is very small (in fact it's 71).
Caching those results of
countFactors(t * p^n)
let's the runtime of the program drop from 2.6 to 0.35 seconds.
Note
T_n is at most 60, so max(T_n * 61^10) = 60 * 61^10 approx 4.28 * 10^19 is the largest value I will encounter in my computations.
Unfortunately this value is beyond the range of 64 bit integers (it requires 66 bits) and I needed to switch to GCC's 128 bit extension.
Therefore this code doesn't compile with Visual C++ etc.
I didn't like this problem because I spent too much time "discovering" that I need 128 bit arithmetic.
Interactive test
This feature is not available for the current problem.
My code
… was written in C++11 and can be compiled with G++. You can download it, too.
#include <iostream>
#include <vector>
#include <unordered_map>
// I had overflows with 64 bit arithmetic, so I switched to GCC's 128 bit extension
typedef __int128 Number;
// compute the exponent of prime in the factorization of f!
unsigned long long countFactors(Number f, unsigned int prime)
{
// Legendre's formula, https://en.wikipedia.org/wiki/Legendre%27s_formula
unsigned long long result = 0;
Number power = prime;
while (power <= f)
{
result += f / power;
power *= prime;
}
return result;
}
// variables of the problem statement:
// p = prime = 61
// q = iterations = 10^7
// moduloExponent = 10 (because of 61^10)
unsigned long long solve(unsigned int prime, unsigned int iterations, unsigned int exponent)
{
// compute prime^moduloExponent => 61^10
unsigned long long modulo = 1;
for (unsigned int i = 1; i <= exponent; i++)
modulo *= prime;
// will be 61^i => 61^0, 61^1, 61^2, ..., 61^10 and keep it at 61^10
Number maxPower = 1;
// seed of pseudo-random number generator
unsigned long long s = 290797;
unsigned long long result = 0;
for (unsigned int i = 0; i <= iterations; i++)
{
// T(i, 61) * 61^i
auto t = s % prime;
// => but 61^i limited to 61^10
auto product = t * maxPower;
// I observed only 71 different products (in 1000000 iterations !), let's cache them
static std::unordered_map<Number, unsigned long long> cache;
auto lookup = cache.find(product);
if (lookup == cache.end())
{
// new, unknown parameters, must call countFactors()
auto current = countFactors(product, prime);
// cache the value
cache[product] = current;
// add it to the result, too
result += current;
}
else
{
// add looked up value
result += lookup->second;
}
// keep under 61^10
result %= modulo;
// 61^i => 61^(i+1), but limit to 61^10
if (maxPower < modulo)
maxPower *= prime;
// next random number
s *= s;
s %= 50515093;
}
return result;
}
int main()
{
unsigned int prime = 61;
unsigned int iterations = 10000000;
unsigned int exponent = 10;
std::cin >> prime >> iterations >> exponent;
std::cout << solve(prime, iterations, exponent) << std::endl;
return 0;
}
This solution contains 13 empty lines, 20 comments and 3 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.3 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
October 19, 2017 submitted solution
October 19, 2017 added comments
Difficulty
Project Euler ranks this problem at 35% (out of 100%).
Links
projecteuler.net/thread=288 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python blog.dreamshire.com/project-euler-288/ (written by Mike Molony)
Python github.com/evilmucedin/project-euler/blob/master/euler288/288.py (written by Den Raskovalov)
Python github.com/LaurentMazare/ProjectEuler/blob/master/e288.py (written by Laurent Mazare)
Python github.com/Meng-Gen/ProjectEuler/blob/master/288.py (written by Meng-Gen Tsai)
Python github.com/smacke/project-euler/blob/master/python/288.py (written by Stephen Macke)
Python github.com/steve98654/ProjectEuler/blob/master/288.py
Java github.com/thrap/project-euler/blob/master/src/Java/Problem288.java (written by Magnus Solheim Thrap)
Perl github.com/shlomif/project-euler/blob/master/project-euler/288/euler-288-v1.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 |
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 287 - Quadtree encoding (a simple compression algorithm) | Digital Signature - problem 290 >> |