<< problem 208 - Robot Walks | Divisor Square Sum - problem 211 >> |
Problem 209: Circular Logic
(see projecteuler.net/problem=209)
A k-input binary truth table is a map from k input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit.
For example, the 2-input binary truth tables for the logical AND and XOR functions are:
xyx AND y
000
010
100
111
xyx XOR y
000
011
101
110
How many 6-input binary truth tables, tau, satisfy the formula
tau(a, b, c, d, e, f) \space \text{AND} \space tau(b, c, d, e, f, a \space \text{XOR} \space (b \space \text{AND} \space c)) = 0
for all 6-bit inputs (a, b, c, d, e, f)?
My Algorithm
The most crucial step is to recognize that there is a 1:1 mapping (bijective mapping) between (a, b, c, d, e, f) and (b, c, d, e, f, a \space \text{XOR} \space (b \space \text{AND} \space c)) = 0.
Therefore my program maps each possible input (a, b, c, d, e, f) to (b, c, d, e, f, a \space \text{XOR} \space (b \space \text{AND} \space c)) = 0.
These six variables are equivalent to a set of all binary numbers from 0 to 2^6 - 1 (=63).
I store that mapping in connections
.
Then I have to find all cycles: how to long it take that a number is mapped to itself: connections[connections[connections[...connections[x]]]] = x
.
Each number is part of exactly one cycle - most are very short but the longest has 46 elements.
Note that if x
maps to itself after s
steps, then each other number of the same cycle maps to itself after s
steps, too.
Therefore all numbers in the same cycle can be treated equally.
I computed the number of possibilities for small cycle lengths (essentially they can't can have consecutive ones) and looked up my values in OEIS.
They are called Lucas numbers (see en.wikipedia.org/wiki/Lucas_number) and extremely similar to the Fibonacci sequence.
Each cycle is independent of each other therefore the Lucas numbers of all cycles have to be multiplied.
Note
There is no live test available for my solution.
Interactive test
This feature is not available for the current problem.
My code
… was written in C++11 and can be compiled with G++, Clang++, Visual C++. You can download it, too.
#include <iostream>
#include <bitset> // I often prefer std::vector<bool> but let's try some of the rarely included C++ containers !
int main()
{
// 2^6 = 64
const auto SixtyFour = 64;
// go through all 2^6 = 64 possible inputs of tau(a,b,c,d,e,f) and find the corresponding state tau(b,c,d,e,f,a XOR (b AND c))
unsigned char connections[SixtyFour];
for (auto from = 0; from < SixtyFour; from++) // state of first tau
{
std::bitset<6> leftSide = from;
std::bitset<6> rightSide;
rightSide[0] = leftSide[1]; // b => a
rightSide[1] = leftSide[2]; // c => b
rightSide[2] = leftSide[3]; // d => c
rightSide[3] = leftSide[4]; // e => d
rightSide[4] = leftSide[5]; // f => e
rightSide[5] = leftSide[0] ^ (leftSide[1] & leftSide[2]); // a ^ (b & c) => f
// connections[from] = to
connections[from] = rightSide.to_ulong();
}
// precompute Lucas numbers
unsigned long long lucas[SixtyFour + 1] = { 2, 1 }; // seeds
for (auto i = 2; i <= SixtyFour; i++) // actually I don't need all of them, longest cycle is < 64
lucas[i] = lucas[i - 2] + lucas[i - 1]; // computation is similar to Fibonacci, but different seeds
// multiply Lucas numbers of each cycle length
unsigned long long result = 1;
// find cycles
std::bitset<SixtyFour> used = 0; // set used[x] to true if state x was processed
while (!used.all())
{
// pick a randomly chosen available state
// I always take the smallest / lowest but it doesn't really matter which one I pick
auto start = 0;
while (used[start])
start++;
// walk through the states until the initial state is reached again
auto current = start;
auto cycleLength = 0;
do
{
// "use" this state
used[current] = true;
cycleLength++;
// continue with next state in this cycle
current = connections[current];
} while (current != start);
// include all those combinations
result *= lucas[cycleLength];
}
// hooray ...
std::cout << result << std::endl;
return 0;
}
This solution contains 11 empty lines, 13 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
September 12, 2017 submitted solution
September 12, 2017 added comments
Difficulty
Project Euler ranks this problem at 60% (out of 100%).
Links
projecteuler.net/thread=209 - 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/209.py (written by Meng-Gen Tsai)
Python github.com/smacke/project-euler/blob/master/python/209.py (written by Stephen Macke)
C++ github.com/roosephu/project-euler/blob/master/209.cpp (written by Yuping Luo)
Java github.com/HaochenLiu/My-Project-Euler/blob/master/209.java (written by Haochen Liu)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem209.java (written by Magnus Solheim Thrap)
Mathematica github.com/LaurentMazare/ProjectEuler/blob/master/e209.ml (written by Laurent Mazare)
Mathematica github.com/steve98654/ProjectEuler/blob/master/209.nb
Perl github.com/shlomif/project-euler/blob/master/project-euler/209/euler-209-v1.pl (written by Shlomi Fish)
Perl github.com/shlomif/project-euler/blob/master/project-euler/209/euler-209-v2.pl (written by Shlomi Fish)
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 |
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 |
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 208 - Robot Walks | Divisor Square Sum - problem 211 >> |