<< problem 100 - Arranged probability | Triangle containment - problem 102 >> |
Problem 101: Optimum polynomial
(see projecteuler.net/problem=101)
If we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term,
as there are infinitely many polynomial functions that can model the sequence.
As an example, let us consider the sequence of cube numbers. This is defined by the generating function,
u_n = n^3: 1, 8, 27, 64, 125, 216, ...
Suppose we were only given the first two terms of this sequence. Working on the principle that "simple is best" we should assume a linear relationship
and predict the next term to be 15 (common difference 7). Even if we were presented with the first three terms, by the same principle of simplicity, a quadratic relationship should be assumed.
We shall define OP(k, n) to be the nth term of the optimum polynomial generating function for the first k terms of a sequence.
It should be clear that OP(k, n) will accurately generate the terms of the sequence for n <= k, and potentially the first incorrect term (FIT) will be OP(k, k+1);
in which case we shall call it a bad OP (BOP).
As a basis, if we were only given the first term of sequence, it would be most sensible to assume constancy; that is, for n >= 2, OP(1, n) = u_1.
Hence we obtain the following OPs for the cubic sequence:
OP(1, n) = 1
1, 1, 1, 1, ...
OP(2, n) = 7n-6
1, 8, 15, ...
OP(3, n) = 6n^2-11n+6
1, 8, 27, 58, ...
OP(4, n) = n^3
1, 8, 27, 64, 125, ...
Clearly no BOPs exist for k >= 4.
By considering the sum of FITs generated by the BOPs (indicated in bold above), we obtain 1 + 15 + 58 = 74.
Consider the following tenth degree polynomial generating function:
u_n = 1 - n + n^2 - n^3 + n^4 - n^5 + n^6 - n^7 + n^8 - n^9 + n^10
Find the sum of FITs for the BOPs.
My Algorithm
When I read this problem, I didn't know anything about polynomial interpolation - and started reading the Wikipedia page: en.wikipedia.org/wiki/Polynomial_interpolation
The Lagrange polynomial caught my attention but my implementation just couldn't find the correct solution.
Then I tried the Newton polynomial and succeeded. Even more, I was able to fix the off-by-one error in my Lagrange code ...
Nevertheless, I kept both routines in my solution. They return the same result.
Modifications by HackerRank
[TODO] I modified my code to accept arbitrary coefficients for the polynomial generating function (originally { +1, -1, +1, -1, +1, -1, +1, -1, +1, -1, +1 }
)
but still fail to solve anything else than the default input.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This live test is based on the Hackerrank problem.
This is equivalent toecho "0 0 0 1" | ./101
Output:
Note: the original problem's input 11 1 -1 1 -1 1 -1 1 -1 1 -1 1
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.
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).
//#define ORIGINAL
#include <iostream>
#include <vector>
// compute sum(coeff[i] * x^i)
template <typename T>
T sequence(T x, const std::vector<T>& coefficients)
{
T xx = 1;
T result = 0;
for (auto i : coefficients)
{
result += i * xx;
xx *= x;
}
return result;
}
// given f(1),f(2),f(3),...f(n) then find f(n+1)
// (Lagrange polynomials)
template <typename T>
T lagrange(const std::vector<T>& known)
{
T result = 0;
size_t next = known.size() + 1;
for (size_t i = 1; i < next; i++)
{
// build Lagrange polynomials
// n = numerator, d = denominator
T n = 1;
T d = 1;
for (size_t j = 1; j < next; j++)
{
if (i == j)
continue;
n *= next - j;
d *= i - j;
}
// evaluate
result += known[i - 1] * (n / d);
}
return result;
}
// given f(1),f(2),f(3),...f(n) then find f(n+1)
// (Newton divided differences)
template <typename T>
T newton(std::vector<T> known)
{
T result = known[0];
size_t j = 1;
size_t k = known.size();
for (size_t last = known.size() - 1; last > 0; last--)
{
for (size_t i = 0; i < last; i++)
known[i] = (known[i + 1] - known[i]) / j;
T multDiff = 1;
for (size_t i = 0; i < j; i++)
multDiff *= k - i;
result += known[0] * multDiff;
j++;
}
return result;
}
int main()
{
// read coefficients
#ifdef ORIGINAL
std::vector<long long> coefficients = { +1, -1, +1, -1, +1, -1, +1, -1, +1, -1, +1 };
#else
size_t numCoefficients;
std::cin >> numCoefficients;
std::vector<long long> coefficients(numCoefficients + 1);
for (auto& i : coefficients)
std::cin >> i;
#endif
long long sum = 0;
std::vector<long long> data;
// iterate over 10 points
for (long long x = 1; x < (long long)coefficients.size(); x++)
{
// add the next point
data.push_back(sequence(x, coefficients));
// estimate next point
long long next = lagrange(data);
//long long next = newton(data);
sum += next;
#ifndef ORIGINAL
std::cout << (next % 1000000007) << " ";
#endif
}
#ifdef ORIGINAL
std::cout << sum << std::endl;
#endif
return 0;
}
This solution contains 16 empty lines, 13 comments and 9 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
May 23, 2017 submitted solution
May 23, 2017 added comments
Difficulty
Project Euler ranks this problem at 35% (out of 100%).
Links
projecteuler.net/thread=101 - 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-101-optimum-polynomial-function/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/101.cs (written by Haochen Liu)
Python github.com/LaurentMazare/ProjectEuler/blob/master/e101.py (written by Laurent Mazare)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p101.py (written by Nayuki)
Python github.com/smacke/project-euler/blob/master/python/101.py (written by Stephen Macke)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/101.cc (written by Meng-Gen Tsai)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p101.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem101.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem101.go (written by Frederick Robinson)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p101.mathematica (written by Nayuki)
Mathematica github.com/steve98654/ProjectEuler/blob/master/101.nb
Scala github.com/samskivert/euler-scala/blob/master/Euler101.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/101-Optimum-polynomial.pl (written by Gustaf Erikson)
Perl github.com/shlomif/project-euler/blob/master/project-euler/101/euler-101.pl (written by Shlomi Fish)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p101.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 |
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 100 - Arranged probability | Triangle containment - problem 102 >> |