<< problem 518 - Prime triples and geometric sequences | Odd elimination - problem 539 >> |
Problem 523: First Sort I
(see projecteuler.net/problem=523)
Consider the following algorithm for sorting a list:
1. Starting from the beginning of the list, check each pair of adjacent elements in turn.
2. If the elements are out of order:
2a. Move the smallest element of the pair at the beginning of the list.
2b. Restart the process from step 1.
3. If all pairs are in order, stop.
For example, the list { 4 1 3 2 }
is sorted as follows:
4 1 3 2
(4 and 1 are out of order so move 1 to the front of the list)
1 4 3 2
(4 and 3 are out of order so move 3 to the front of the list)
3 1 4 2
(3 and 1 are out of order so move 1 to the front of the list)
1 3 4 2
(4 and 2 are out of order so move 2 to the front of the list)
2 1 3 4
(2 and 1 are out of order so move 1 to the front of the list)
1 2 3 4
(The list is now sorted)
Let F(L) be the number of times step 2a is executed to sort list L. For example, F({ 4 \space 1 \space 3 \space 2 }) = 5.
Let E(n) be the expected value of F(P) over all permutations P of the integers {1, 2, ..., n}.
You are given E(4) = 3.25 and E(10) = 115.725.
Find E(30). Give your answer rounded to two digits after the decimal point.
My Algorithm
I solved this problem in a very empiric way:
- write code to solve the problem for small input values (see
evaluate
) - stare at the output far too long
- finally see some inner structures after two days
evaluate
can solve E(10) in a few seconds and will produce this output:xE(x)#moves#permutations
1001
20.512
31.596
43.257824
56.25750120
611.428220720
720.421029005040
836.29146328040320
964.6223451120362880
10115.734199428803628800
These numbers didn't reveal anything at all - but then I computed the difference E(x) - E(x-1) (as fractions):
xE(x) - E(x-1)denominator = x
21/21/2
313/3
47/47/4
5315/5
631/631/6
7963/7
8127/8127/8
985/3255/9
10511/10511/10
The second columns already shows a pattern for E(x) - E(x - 1) when x is even:
the numerator is always one less than a power of two and the denominator is always x.
When enforcing the denominator to be x (third column) then the same pattern appears for odd x as well and I finally have a formula:
E(x) - E(x - 1) = dfrac{2^{x-1} - 1}{x}
All I need is a simple
for
-loop iterating over all x <= 30.
Note
I somehow prefer the way evaluate()
finds the solutions: play around with data structures, STL algorithms, ... → let the computer do some hard work.
The formula used to determine E(30) is pretty simple (though a bit tricky to find) and could have been solved with a pencil and paper only.
That's not why I studied computer science and work as a software engineer ...
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 10 | ./523
Output:
Note: the original problem's input 30
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 <iomanip>
#include <vector>
#include <algorithm>
// execute all moves on all permutations of a given size
// → only needed to get an idea what the formula looks like, not needed anymore
double evaluate(unsigned int size)
{
// data = { 1,2,3,...,size }
std::vector<unsigned int> data, current;
for (unsigned int i = 1; i <= size; i++)
data.push_back(i);
// count moves and permutations
unsigned int moves = 0;
unsigned int permutations = 0;
do
{
// get current permutation
current = data;
permutations++;
// sort container
unsigned int pos = 1;
// compare data[pos - 1] and data[pos]
while (pos < size)
{
// pair in wrong order ?
if (current[pos] < current[pos - 1])
{
// rotate all elements from 0 to pos to the right once (last element becomes the first)
std::rotate(current.begin(), current.begin() + pos, current.begin() + pos + 1);
moves++;
// restart
pos = 1;
}
else
pos++;
}
} while (std::next_permutation(data.begin(), data.end()));
std::cout << "E(" << size << ")=" << moves / double(permutations) // result
<< " =" << moves << "/" << permutations << std::endl; // and as a fraction
return moves / double(permutations);
}
int main()
{
unsigned int limit = 10;
std::cin >> limit;
std::cout << std::fixed << std::setprecision(2);
// solve for small input values
//for (unsigned int i = 1; i <= limit; i++)
// evaluate(i);
double result = 0;
for (unsigned int i = 1; i <= limit; i++)
{
// 2^(i-1) - 1
auto numerator = (1 << (i - 1)) - 1; // 0,1,3,7,15,31,...
// add to result
result += numerator / double(i);
}
std::cout << result << std::endl;
return 0;
}
This solution contains 8 empty lines, 15 comments and 4 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
September 4, 2017 submitted solution
September 4, 2017 added comments
Difficulty
Project Euler ranks this problem at 60% (out of 100%).
Links
projecteuler.net/thread=523 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python github.com/HaochenLiu/My-Project-Euler/blob/master/523.py (written by Haochen Liu)
Python github.com/Meng-Gen/ProjectEuler/blob/master/523.py (written by Meng-Gen Tsai)
Python github.com/smacke/project-euler/blob/master/python/523.py (written by Stephen Macke)
C++ github.com/evilmucedin/project-euler/blob/master/euler523/523.cpp (written by Den Raskovalov)
C++ github.com/HaochenLiu/My-Project-Euler/blob/master/523-2.cpp (written by Haochen Liu)
C++ github.com/roosephu/project-euler/blob/master/523.cpp (written by Yuping Luo)
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 518 - Prime triples and geometric sequences | Odd elimination - problem 539 >> |