<< problem 28 - Number spiral diagonals | Digit fifth powers - problem 30 >> |
Problem 29: Distinct powers
(see projecteuler.net/problem=29)
Consider all integer combinations of a^b for 2 <= a <= 5 and 2 <= b <= 5:
2^2= 4, 2^3= 8, 2^4= 16, 2^5= 32
3^2= 9, 3^3= 27, 3^4= 81, 3^5= 243
4^2=16, 4^3= 64, 4^4=256, 4^5=1024
5^2=25, 5^3=125, 5^4=625, 5^5=3125
If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by ab for 2 <= a <= 100 and 2 <= b <= 100?
My Algorithm
The core problem is: find all x^y where also an a^b exists with x>a and x <= limit (a "collision").
The only collision in the problem's example is x^y=4^2=16 and a^b=2^4=2^4=16.
My variable repeated
counts all numbers that appear repeatedly (such as 16).
The final result will be (limit-1)^2 - repeated (for the example we found that repeated=1 and therefore (5-1)^2 - 1 = 15).
The rest of this algorithm is all about an efficient way to find the value of repeated.
Note: we have limit=5 in the example but we need to solve for limit=100 (or limit=100000 in the modified Hackerrank problem).
Because of 4=2^2 we know that 4^y=2^{2y}: all powers with base 4 can be rewritten as 4^2=2^{2*2}=2^4, 4^3=2^{2*3}=2^6, 4^4=2^{2*4}=2^8 and 4^5=2^{2*5}=2^{10}.
Therefore when we convert all powers of 4 to powers of 2 we use those exponents: 2,3,4,5
(for a=2) and 4,6,8,10
(for x=4 → a=2^2).
Obviously 4
is found in both sets. That's our collision.
The first step in my program is to find all exponents if we reduce all numbers x to their "parent" a^b:
1. we know for certain that all numbers from 2 to limit will be used: 2,3,4,5
2. if x=a^2 is a valid base (that means x <= limit), then 2*2,2*3,2*4,2*5
will be used for base a, too.
3. if x=a^3 is a valid base then 3*2,3*3,3*4,3*5
will be used for base a, too.
4. if x=a^4 is a valid base then 4*2,4*3,4*4,4*5
will be used for base a, too.
5. and so on ...
My container minExponent
records which exponents could be used. If there are multiple combinations, then the lowest is stored.
I hope an example makes things a bit clearer:
1. insert 1
at positions 2,3,4,5
2. insert 2
at positions 6,8,10
→ but not at position 4 because that one is already occupied
3. we can stop because there is no other base x=2^3 <= limit
minExponent
contains 2 → 1, 3 → 1, 4 → 1, 5 → 1, 6 → 2, 8 → 2, 10 → 2
An std::vector
doesn't have gaps and starts at 0, that's why I there are some unused entries, too, filled with zero:
minExponent = { 0, 0, 1, 1, 1, 1, 2, 0, 2, 0, 2 }
The "highest" collision with base 2^b=x^y can be found for 2^b=64^y=2^{8y} (next power of 2 is 128, which is larger than 100).
For the modified Hackerrank problem, this "highest" collision with base 2^b=x^y can be found for x^y=65536^y=2^{16y} (limit is 100000 instead of 100).
That's why MaxBasePower = 16
.
My container base
is zero for every base[x]
where there no a^b=x exists. The data structure is incrementally updated and initially all entries are zero.
If we encounter such a base[x]=0
then we immediately fill base[x*x]=x
and base[x*x*x]=x
and base[x*x*x*x]=x
...
because x*x
, x*x*x
, ... will collide with x
.
In the example, for x=2
we'll find that base[2]=0
and hence fill base[2*2]=2
.
If base[x] == 0
then collisions with smaller x are impossible.
If base[x] != 0
then x
has a "parent" such that x=base[x]^exponent. Collisions are possible.
We scan through minExponent
and count all collisions (in repeated
):
Due to x^y = base[x]^{y*exponent} all elements minExponent[y*exponent]
have to be checked if that entry was
already used by some other x
.
Alternative Approaches
The original problem can be solved by brute-force if your language supports big integers.
I haven't tried it but maybe you can store log{a^b} in a std::set
, too.
Modifications by HackerRank
The higher limit of 100000 instead of 100 forced me to come up with my slightly more complex but much faster solution.
The result exceeds 32 bits (for limit close to 100000), that's why I introduced the all
variable as unsigned long long
.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 5 | ./29
Output:
Note: the original problem's input 100
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.
#include <iostream>
#include <vector>
int main()
{
// I called it "limit" in the explanation
unsigned int maxExponent;
std::cin >> maxExponent;
// 2^17 > 10^5 (max. input)
const unsigned int MaxBasePower = 16;
// if a^b = base^(exponent*basePower)
// then b = (1..n) but exponent*basePower = (basePower, 2*basePower, 3*basePower, ..., n*basePower)
// store for each product exponent*basePower the smallest basePower
std::vector<unsigned int> minExponent((maxExponent+1)*MaxBasePower);
for (unsigned int i = 1; i <= MaxBasePower; i++)
for (unsigned int j = 1; j <= maxExponent; j++)
if (minExponent[i*j] == 0)
minExponent[i*j] = i;
// all "a" which can be composed as base^exponent, stored as [a] => [base]
std::vector<unsigned int> base(maxExponent + 1, 0);
// how often numbers were used multiple times (those are the collisions we are looking for)
unsigned int repeated = 0;
// analyze all bases
for (unsigned int x = 2; x <= maxExponent; x++) // maximum base is maxExponent, too
{
// is x = parent^exponent ?
auto parent = base[x];
if (parent == 0) // no
{
// find all future children where "x" is the parent
auto power = x * x;
// [x^2] = [x^3] = [x^4] = ... = x
while (power <= maxExponent)
{
base[power] = x;
power *= x;
}
// no x=a^b possible, "repeated" remains unchanged
continue;
}
// we have a parent, find exponent such that a = parent^exponent
unsigned int exponent = 0;
auto reduce = x;
while (reduce > 1)
{
reduce /= parent;
exponent++;
}
// analyze all pairs, and count all numbers we saw before (repeated++)
for (unsigned int y = 2; y <= maxExponent; y++)
{
// that exponent was already used ?
if (minExponent[y * exponent] < exponent)
repeated++;
}
}
// there are (maxExponent-1)^2 combinations, subtract all duplicates
unsigned long long all = maxExponent - 1;
auto result = all*all - repeated;
std::cout << result << std::endl;
return 0;
}
This solution contains 10 empty lines, 16 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 24, 2017 submitted solution
April 7, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler029
My code solves 21 out of 21 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=29 - 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-29-distinct-terms-sequence-ab/ (written by Kristian Edlund)
C github.com/eagletmt/project-euler-c/blob/master/20-29/problem29.c (written by eagletmt)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p029.java (written by Nayuki)
Javascript github.com/dsernst/ProjectEuler/blob/master/29 Distinct powers.js (written by David Ernst)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p029.mathematica (written by Nayuki)
Haskell github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p029.hs (written by Nayuki)
Scala github.com/samskivert/euler-scala/blob/master/Euler029.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/029-Distinct-powers.pl (written by Gustaf Erikson)
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 |
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 28 - Number spiral diagonals | Digit fifth powers - problem 30 >> |