<< problem 358 - Cyclic numbers Bézier Curves - problem 363 >>

# Problem 359: Hilbert's New Hotel

An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get a room at Hilbert's newest infinite hotel.
The hotel contains an infinite number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of rooms (numbered 1, 2, 3, etc.).

Initially the hotel is empty. Hilbert declares a rule on how the nth person is assigned a room:
person n gets the first vacant room in the lowest numbered floor satisfying either of the following:

• the floor is empty
• the floor is not empty, and if the latest person taking a room in that floor is person m, then m + n is a perfect square
Person 1 gets room 1 in floor 1 since floor 1 is empty.
Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.
Person 2 instead gets room 1 in floor 2 since floor 2 is empty.
Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.

Eventually, every person in the line gets a room in the hotel.

Define P(f, r) to be n if person n occupies room r in floor f, and 0 if no person occupies the room. Here are a few examples:
P(1, 1) = 1
P(1, 2) = 3
P(2, 1) = 2
P(10, 20) = 440
P(25, 75) = 4863
P(99, 100) = 19454

Find the sum of all P(f, r) for all positive f and r such that f * r = 71328803586048 and give the last 8 digits as your answer.

# My Algorithm

My standard procedure is to make sure I can solve the problem for small input values:

• fillHotel() "puts" guests into their rooms
• Pslow() performs a simple lookup in rooms
That's pretty fast for a few thousands guests but there's no chance of solving the real problem.

Printing the guest IDs of the first floors / rooms showed a certain pattern:
floor \ room123456789
1136101521283645
2279162029354654
34511142227374456
481719303447536876
5121323263843576480
61831334852697594102
72425394258638188108
8324951707495101124132
9404159628287109116140

• the first floor is the triangular series n(n+1)/2
• the difference between the first and the second guest is 1 on odd floors and 2f+1 on even floors
• the difference between the second and the third guest is 2 on odd floors and 2f on even floors
• differences between odd rooms on the second floor is 9-2=7, 20-9=11, 35-20=15, 54-35=19, ... → difference increases by 4 with each step
• differences between even rooms on the second floor is 16-7=9, 29-16=13, 46-29=17, ... → difference increases by 4 with each step
• the third, fourth, fifth, ... floor show a pattern similar to the pattern I found in the second floor
1. be able to compute the first floor P(1, r)
2. find the first guest of a floor P(f, 1)
3. find the increment between first and second room P(f, 2) - P(f, 1)
4. find the increment between second and third room P(f, 3) - P(f, 2)
5. Based on 3. and 4. find the initial differences between odd rooms P(f, 3) - P(f, 1) and even rooms P(f, 4) - P(f, 2)

With lots of trial-and-error I found that the first guest of floor f is
(1) even-numbered floors: P(f, 1) = \lfloor dfrac{floor^2}{2} \rfloor

(2) odd-numbered floors: P(f, 1) = dfrac{(floor + 1) * (floor - 1)}{2} except for P(1, 1) = 1

C++ automatically truncates quotients so (floor + 1) / 2 * floor is good enough for (1) while also helpful for (2).

incrementOdd and incrementEven are set according to the rules I defined above.
Unfortunately, a simple loop would take forever for large room numbers.
However, the constant increase of 4 per step lets me use the triangle formula dfrac{x(x+1)}{2} with some modifications.

The input value 71328803586048 has only two prime factors: 2^27 * 3^12.
Iterating over each combination 2^i * 3^j where 0 <= i <= 27 and 0 <= j <= 12 returns all 364 divisors.

## Note

Well, this is one of those problems where I ask myself: whyyyyyyy ?
I couldn't find a scientific approach and everything I did was playing around with weird formulas until P() produced the same output as Pslow().
I didn't learn anything new nor did I have fun.
It's kind of strange that so many people solved this problem (with ease ?!) because I'm pretty sure I saw a few patterns just by pure luck.

Please keep in mind that I had to use G++'s 128 bit integer extension and therefore the code doesn't compile with Visual C++.

# Interactive test

You can submit your own input to my program and it will be instantly processed at my server:

Input data (separated by spaces or newlines):
Note: Enter x and y to find all solutions for 2^x * 3^y

This is equivalent to
echo "1 1" | ./359

Output:

Note: the original problem's input 27 12 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++. You can download it, too.

       #include <iostream>
#include <vector>
#include <cmath>

// ---------- slow algorithm ----------

std::vector<std::vector<unsigned int>> rooms;

// look up result in precomputed 2D vector "rooms"
unsigned int Pslow(unsigned int floor, unsigned int room)
{
// from one-indexed to zero-based
floor--;
room--;

if (floor >= rooms.size())
return 0;
if (room >= rooms[floor].size())
return 0;

return rooms[floor][room];
}

// return true if x is a perfect square
bool isSquare(unsigned int x)
{
unsigned int root = sqrt(x);
return root * root == x;
}

// precompute Hilbert's New Hotel, too slow for the problem, but solves the examples
void fillHotel(unsigned int numPersons)
{
// one iteration per person
for (unsigned int person = 1; person < numPersons; person++)
{
bool needNewFloor = true;
// try to place person in an existing floor
for (size_t floor = 0; floor < rooms.size(); floor++)
{
// last + person should be a perfect square
if (isSquare(rooms[floor].back() + person))
{
rooms[floor].push_back(person);
needNewFloor = false;
break;
}
}

// no suitable floor found, create a new floor
if (needNewFloor)
{
std::vector<unsigned int> newFloor = { person };
rooms.push_back(newFloor);
}
}
}

// ---------- fast algorithm ----------

// compute P(floor, room)
unsigned int P(unsigned long long floor, unsigned long long room, unsigned int modulo = 100000000)
{
// compute number in first room of that floor
__int128 result = (__int128)(floor + 1) / 2 * floor;
if (floor % 2 == 1 && floor > 1)
result -= (floor + 1) / 2;

// separate increments for odd and even rooms
__int128 incrementEven = 1;
if (floor % 2 == 0)
incrementEven = 2 * floor + 1;

__int128 incrementOdd = 2;
if (floor % 2 == 1)
incrementOdd = 2 * floor;

// and they are a bit different on the first floor
if (floor == 1)
{
incrementOdd  = 3;
incrementEven = 2;
}

// my original code:
//for (unsigned int i = 2; i <= room; i += 2)
//{
//  result += incrementEven;
//  incrementEven += 2;
//}
//for (unsigned int i = 3; i <= room; i += 2)
//{
//  result += incrementOdd;
//  incrementOdd += 2;
//}
// and converted to a closed form:

// number of rooms with even room numbers
__int128 numEven = room / 2;
// sum of 1+2+3+...+numEven
auto triangleEven = numEven * (numEven + 1) / 2;
// sum of 2+4+6+...+2*numEven
triangleEven *= 2;

// number of rooms with even odd numbers
__int128 numOdd = (room - 1) / 2;
// sum of 1+2+3+...+numOdd
auto triangleOdd = numOdd * (numOdd + 1) / 2;
// sum of 2+4+6+...+2*numOdd
triangleOdd *= 2;

result += numEven * (incrementEven - 2) + triangleEven;
result += numOdd  * (incrementOdd  - 2) + triangleOdd;

return result % modulo;
}

int main()
{
auto maxExponentTwo   = 27;
auto maxExponentThree = 12;
auto number = 71328803586048ULL;

std::cin >> maxExponentTwo >> maxExponentThree;
number = pow(2ULL, maxExponentTwo) * pow(3ULL, maxExponentThree);

const unsigned int Modulo = 100000000;

// solve examples with slow algorithm
//fillHotel(20000);
//std::cout << Pslow( 1,  1) << " " << Pslow( 1,  2) << " " << Pslow( 2,   1) << " "
//          << Pslow(10, 20) << " " << Pslow(25, 75) << " " << Pslow(99, 100) << std::endl;

unsigned int sum = 0;
// 71328803586048 = 2^27 * 3^12
auto two = 1ULL;
// iterate over all exponents of 2 and 3
for (auto expTwo = 0; expTwo <= maxExponentTwo; expTwo++, two *= 2)
{
auto three = 1ULL;
for (auto expThree = 0; expThree <= maxExponentThree; expThree++, three *= 3)
{
auto floor = two * three;    //         2^expTwo      * 3^expThree
auto room  = number / floor; // will be 2^(27-expTwo) * 3^(12-expThree)
sum += P(floor, room, Modulo);
sum %= Modulo;
}
}

// finally ...
std::cout << sum << std::endl;
return 0;
}


This solution contains 24 empty lines, 39 comments and 3 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 6, 2017 submitted solution

# Difficulty

Project Euler ranks this problem at 25% (out of 100%).

# 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
The 310 solved problems (that's level 12) had an average difficulty of 32.6% at Project Euler and
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.

 << problem 358 - Cyclic numbers Bézier Curves - problem 363 >>
more about me can be found on my homepage, especially in my coding blog.
some names mentioned on this site may be trademarks of their respective owners.
thanks to the KaTeX team for their great typesetting library !