<< problem 458 - Permutations of Project | Phigital number base - problem 473 >> |
Problem 461: Almost Pi
(see projecteuler.net/problem=461)
Let f_n(k) = e^{k/n} - 1, for all non-negative integers k.
Remarkably, f_200(6) + f_200(75) + f_200(89) + f_200(226) = 3.141592644529 ... approx pi.
In fact, it is the best approximation of pi of the form f_n(a) + f_n(b) + f_n(c) + f_n(d) for n = 200.
Let g(n) = a^2 + b^2 + c^2 + d^2 for a, b, c, d that minimize the error: |f_n(a) + f_n(b) + f_n(c) + f_n(d) - pi|
(where |x| denotes the absolute value of x).
You are given g(200) = 6^2 + 75^2 + 89^2 + 226^2 = 64658.
Find g(10000).
Very inefficient solution
My code needs more than 256 MByte RAM to find the correct result. (scroll down to the benchmark section)
Apparantly a much smarter algorithm exists - or my implementation is just inefficient.
My Algorithm
I tried to find the result with a randomized genetic search but failed because I was always stuck in local minimums - and finally gave up.
Surprisingly, pretty much everybody else solved the problem with something similar to my current approach:
- create all pairs f_10000(a) + f_10000(b)
- for each such pair find a second pair f_10000(c) + f_10000(d) such that |f_10000(a) + f_10000(b) + f_10000(c) + f_10000(d) - pi| is minimized
I can assume pair-wise that a < b and c < d without loss of generality.
Therefore I have to analyze up to T(14211) = 14211 * 14210 / 2 = 100969155 pairs.
However, the sum of a few pairs exceeds pi so that only 72299877 pairs need to be considered (see container
pairs
).To find the optimal partner for each
pairs[i]
I perform a binary search for PI - pairs[i]
.That's the same concept I used in solving problem 266 (and in problem 152).
The STL's
std::upper_bound
returns the first value that is too large. This number and its predecessor need to be analyzed.If their error is less than before then I remember their indices
left
and right
.The final step is to map
left
and right
back to a
, b
, c
, d
.Maybe there is a smarter way than just two nested loops - but they are pretty fast, so that's okay for me.
Alternative Approaches
I'm quite worried that I exceed the memory limit of 256 MByte: my program needs about 640 MByte.
After submitting my result to the Project Euler forum I saw that a clever use of priority queues could reduce memory consumption from O(n^2) to O(n).
Those guys are brilliant !
I thought a while about a segmented algorithm, where pairs
represents only a part of all pairs.
Thus I could stay within the 256 MByte limit at the expense of a severely increased execution time.
However, the main reason against such an approach is that the code would increase a lot, too, and readability suffer massively.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 200 | ./461
Output:
Note: the original problem's input 10000
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>
#include <algorithm>
#include <cmath>
const double PI = 3.1415926535897932;
int main()
{
// example was n = 200, problem asks for n = 10000
unsigned int order = 10000;
std::cin >> order;
// find maximum value such that e^(maximum/n) - 1 <= PI
// ... and while at it: store all values in f
std::vector<double> f;
unsigned int maximum = 0;
while (true)
{
auto current = exp(maximum / double(order)) - 1;
// too large ?
if (current > PI)
break;
f.push_back(current);
maximum++;
}
// generate all pairs f[i] + f[j] <= PI (with i <= j)
std::vector<double> pairs;
pairs.reserve(maximum * maximum / 10); // some heuristic to avoid too frequent allocations
for (size_t i = 0; i < maximum; i++)
for (size_t j = i; j < maximum; j++)
{
// abort, sum exceeds 3.1415
if (f[i] + f[j] > PI)
break;
pairs.push_back(f[i] + f[j]);
}
// sort all values
//std::sort(pairs.begin(), pairs.end());
// a bit faster: compare double as 64 bit integers => works on CPU, not FPU
// only possible because all values are positive and there are no NaN or other special values
std::sort(pairs.begin(), pairs.end(), [] (double a, double b)
{
// cast from 64 bit double to 64 bit integer
auto aa = (const long long*) &a;
auto bb = (const long long*) &b;
return *aa < *bb;
});
// optimal value for f_a + f_b
size_t left = 0;
// optimal value for f_c + f_d
size_t right = 0;
// minimize error |f_a + f_b - PI|
double minError = PI;
for (size_t i = 0; i < pairs.size(); i++)
{
// binary search for the best match
auto current = pairs[i];
auto need = PI - current;
if (need < current) // same as need < PI/2
break;
// this value and its predecessor are candidates
auto match = std::upper_bound(pairs.begin(), pairs.end(), need); // actually "sums.begin() + i" works, too
// "match" is a value slightly too large
auto error = fabs(need - *match);
if (error < minError)
{
minError = error;
left = i;
right = std::distance(pairs.begin(), match);
}
// now "match" is a value slightly too small (or an exact match => spoiler alert: there is no perfect match)
match--;
error = fabs(need - *match);
if (error < minError)
{
minError = error;
left = i;
right = std::distance(pairs.begin(), match);
}
}
// resolve the left pair f_a and f_b
unsigned int result = 0;
bool resolvedLeft = false;
for (size_t a = 0; a < maximum && !resolvedLeft; a++)
for (size_t b = a; b < maximum; b++)
if (pairs[left] == f[a] + f[b])
{
result += a*a + b*b;
resolvedLeft = true;
break;
}
// resolve the left pair f_c and f_d
bool resolvedRight = false;
for (size_t c = 0; c < maximum && !resolvedRight; c++)
for (size_t d = c; d < maximum; d++)
if (pairs[right] == f[c] + f[d])
{
result += c*c + d*d;
resolvedRight = true;
break;
}
std::cout << result << std::endl;
return 0;
}
This solution contains 14 empty lines, 20 comments and 4 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 6.7 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
Peak memory usage was about 634 MByte , thus exceeding the limit of 256 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
September 28, 2017 submitted solution
September 28, 2017 added comments
Difficulty
Project Euler ranks this problem at 30% (out of 100%).
Links
projecteuler.net/thread=461 - 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/461.py (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/461.cpp (written by Yuping Luo)
C++ github.com/steve98654/ProjectEuler/blob/master/461.cpp
Mathematica github.com/steve98654/ProjectEuler/blob/master/461.nb
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 458 - Permutations of Project | Phigital number base - problem 473 >> |