<< problem 109 - Darts | Primes with runs - problem 111 >> |
Problem 110: Diophantine reciprocals II
(see projecteuler.net/problem=110)
In the following equation x, y, and n are positive integers.
dfrac{1}{x} + dfrac{1}{y} = dfrac{1}{n}
It can be verified that when n = 1260 there are 113 distinct solutions and this is the least value of n
for which the total number of distinct solutions exceeds one hundred.
What is the least value of n for which the number of distinct solutions exceeds four million?
NOTE: This problem is a much more difficult version of Problem 108 and as it is well beyond the limitations of a brute force approach it requires a clever implementation.
My Algorithm
As mentioned in my solution for problem 108, a prime factorization can find the number of solutions.
This time I "invert" the algorithm: I generate prime factorizations in ascending order.
If e_0, e_1, e_2, ... are the exponents of the first primes 2, 3, 5, ... then:
value = 2^{e_0} * 3^{e_1} * 5^{e_2} ...
The container exponents
stores these exponents, while prime
obviously holds the prime numbers.
Empirically I found that the first 12 prime numbers (2 ... 37) are sufficient for the original problem.
This gives ((2e_0 + 1)(2e_1 + 1)(2e_2 + 1) ... + 1) factorizations. However, x and y are interchangeable, therefore I must divide the result by 2 as well.
A nice property of std::map
is that its elements are always sorted by their keys.
Therefore todo.begin()
always refers to the smallest unprocessed number.
If it has too few prime factorizations then I increment its components and re-insert them into todo
.
Modifications by HackerRank
Hackerrank has a broader input ranges which requires a few more prime numbers.
Even more, the result may be too big for 64 bit integer. That's why I opt for long double
instead.
The failed test case is probably due to exceeding the precision of long double
.
Note
I noticed that the exponents of larger prime numbers are at most 1 (when processing numbers <= 4000000).
My code runs about 3x faster and needs less memory when I avoid incrementing e_4, e_5, ...
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 100 | ./110
Output:
Note: the original problem's input 4000000
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. Or just jump to my GitHub repository.
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 <iomanip>
#include <vector>
#include <map>
int main()
{
unsigned long long limit = 4000000;
std::cin >> limit;
#define ORIGINAL
#ifdef ORIGINAL
// 12 primes are enough for the original problem, I added a few more for the Hackerrank version
const unsigned int NumPrimes = 12;
// a short list of primes
unsigned int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 };
#else
const unsigned int NumPrimes = 18;
// a short list of primes
unsigned int primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61 };
#endif
// use 1 as a "seed" value (all its primes' exponents are zero)
typedef std::vector<unsigned char> Exponents;
std::map<long double, Exponents> todo = { { 1, Exponents(NumPrimes, 0) } };
while (true)
{
// pick the smallest value and its exponents
auto current = todo.begin();
auto value = current->first;
auto exponents = current->second;
// remove from todo list
todo.erase(current);
// find number of factorizations
unsigned long long uniqueFactors = 1;
for (auto x : exponents)
uniqueFactors *= 2 * x + 1;
// a*b = b*a => divide number of factorizations by 2
uniqueFactors++;
uniqueFactors /= 2;
// stop ?
if (uniqueFactors >= limit)
{
std::cout << std::fixed << std::setprecision(0) << value << std::endl;
break;
}
// increment each primes' exponent by 1 and append new value to todo list
for (size_t i = 0; i < exponents.size(); i++)
{
#ifdef ORIGINAL
// speed optimization: exponents of larger primes can be at most 1
if (exponents[i] == 1 && i > 3) // 3 was found by trial-n-error
break;
#endif
exponents[i]++;
value *= primes[i];
todo[value] = exponents;
// note: std::map prunes duplicates automatically
}
}
return 0;
}
This solution contains 11 empty lines, 12 comments and 10 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.02 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
Peak memory usage was about 8 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 28, 2017 submitted solution
July 28, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler110
My code solves 12 out of 20 test cases (score: 60%)
I failed 1 test cases due to wrong answers and 7 because of timeouts
Difficulty
Project Euler ranks this problem at 40% (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=110 - 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-110-efficient-diophantine-equation/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/110.cs (written by Haochen Liu)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-110.py (written by Hugh Brown)
Python github.com/Meng-Gen/ProjectEuler/blob/master/110.py (written by Meng-Gen Tsai)
Python github.com/smacke/project-euler/blob/master/python/110.py (written by Stephen Macke)
C++ github.com/roosephu/project-euler/blob/master/110.cpp (written by Yuping Luo)
C++ github.com/smacke/project-euler/blob/master/cpp/110.cpp (written by Stephen Macke)
C++ github.com/zmwangx/Project-Euler/blob/master/110/110.cpp (written by Zhiming Wang)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem110.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem110.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/110.nb
Scala github.com/samskivert/euler-scala/blob/master/Euler110.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/110-Diophantine-reciprocals-2.pl (written by Gustaf Erikson)
Perl github.com/shlomif/project-euler/blob/master/project-euler/110/euler-110.pl (written by Shlomi Fish)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p110.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 | 681 | 682 | 683 | 684 | 685 | 686 | 687 | 688 | 689 | 690 | 691 | 692 | 693 | 694 | 695 | 696 | 697 | 698 | 699 | 700 |
701 | 702 | 703 | 704 | 705 | 706 | 707 | 708 | 709 | 710 | 711 | 712 | 713 | 714 | 715 | 716 | 717 | 718 | 719 | 720 | 721 | 722 | 723 |
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 109 - Darts | Primes with runs - problem 111 >> |