<< problem 165 - Intersections | Number Rotations - problem 168 >> |
Problem 166: Criss Cross
(see projecteuler.net/problem=166)
A 4x4 grid is filled with digits d, 0 <= d <= 9.
It can be seen that in the grid
6330
5043
0714
1245
the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.
In how many ways can you fill a 4x4 grid with the digits d, 0 <= d <= 9 so that each row, each column, and both diagonals have the same sum?
My Algorithm
I brute-force the problem with a few performance tweaks.
Let's assign a variable to each cell of the grid:
abcd
efgh
ijkl
mnop
The first step is to find the current sum s (called sum
in my code):
s = a + b + c + d
The "fourth" variable of each row/column/diagonal depends on the three previous and s:
h = s - e - f - g (second row)
l = s - i - j - k (third row)
p = s - m - n - o (fourth row)
m = s - a - e - i (first column)
n = s - b - f - j (second column)
o = s - c - g - k (third column)
Now only 10 instead of 16 variables are unknown.
Actually, j isn't unknown - it can be computed, too:
j = s - d - g - m (anti-diagonal)
My program iterates over all possible values of the remaining 9 variables a, b, c, d, e, f, g, i and k.
Any combination where all variables are between 0
and maxDigit
(which is 9 for the original problem) is valid - with one exception:
I have to check the diagonal, too (s = a + f + k + p), but I saw in my experiments that the fourth column doesn't need to be checked as well.
These are my performance tweaks:
1. If there is an even number of digits (maxDigit = 9
→ 0..9
→ 10 digits), then a can be restricted to 0..(maxDigit - 1)/2
)
For every solution found there is another "inverted" solution where each variable x' = maxDigit - x.
→ about twice as fast
2. The grid can be mirrored along the diagonal such that b <= e. For every b < e there is a second solution found by mirroring along the diagonal.
→ about twice as fast
3. All variables are unsigned: if a variable become negative it will be a huge positive number in C's two-complement representation.
The check if (x < 0 || x > maxDigit)
simplifies to if (x > maxDigit)
which is about 10% faster.
These three optimizations make my program about four times faster.
Alternative Approaches
Nayuki's solution is based on f = b + c + 2d - e - i - k. Look at his code for an explanation - it makes the program about five times faster.
I didn't spend much time on a thorough mathematical analysis of the problem and didn't see that relationship.
Modifications by HackerRank
The maximum digit can be changed via STDIN. The original problem has maxDigit = 9
.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 1 | ./166
Output:
Note: the original problem's input 9
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>
int main()
{
// maximum digit
unsigned int maxDigit = 9;
std::cin >> maxDigit;
// restrict variable "a"
bool even = (maxDigit + 1) % 2 == 0;
auto maxA = even ? (maxDigit - 1) / 2 : maxDigit;
unsigned int result = 0;
for (unsigned int a = 0; a <= maxA; a++) // limit a to 0..4 => for every solution found there is a "inverted" version where x = 9 - x and x = a,b,c,d,...,p
for (unsigned int b = 0; b <= maxDigit; b++)
for (unsigned int c = 0; c <= maxDigit; c++)
for (unsigned int d = 0; d <= maxDigit; d++)
{
// all rows, columns, diagonals must share the same sum
auto sum = a + b + c + d;
for (unsigned int e = b; e <= maxDigit; e++) // !!! start at b instead of zero
for (unsigned int f = 0; f <= maxDigit; f++)
for (unsigned int g = 0; g <= maxDigit; g++)
{
// sum of second row must be identical to first row
auto h = sum - e - f - g;
if (h > maxDigit)
continue;
for (unsigned int i = 0; i <= maxDigit; i++)
{
// sum of first column must be identical to first row
auto m = sum - a - e - i;
if (m > maxDigit)
continue;
// sum of anti-diagonal must be identical to first row
auto j = sum - d - g - m;
if (j > maxDigit)
continue;
// sum of second column must be identical to first row
auto n = sum - b - f - j;
if (n > maxDigit)
continue;
for (unsigned int k = 0; k <= maxDigit; k++)
{
// sum of third column must be identical to first row
auto o = sum - c - g - k;
if (o > maxDigit)
continue;
// sum of third row must be identical to first row
auto l = sum - i - j - k;
if (l > maxDigit)
continue;
// sum of fourth row must be identical to first row
auto p = sum - m - n - o;
if (p > maxDigit)
continue;
// check diagonal, too
if (sum != a + f + k + p)
continue;
// yes, found a solution
result++;
// mirror grid along diagonal, too
if (b < e)
result++;
}
}
}
}
// add "inverted" solutions
if (even)
result *= 2;
std::cout << result << std::endl;
return 0;
}
This solution contains 14 empty lines, 14 comments and 1 preprocessor command.
Benchmark
The correct solution to the original Project Euler problem was found in 0.17 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
June 14, 2017 submitted solution
June 14, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler166
My code solves 8 out of 8 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 50% (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=166 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p166.py (written by Nayuki)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/166.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/166.cpp (written by Yuping Luo)
C++ github.com/smacke/project-euler/blob/master/cpp/166.cpp (written by Stephen Macke)
C++ github.com/steve98654/ProjectEuler/blob/master/166.cpp
C github.com/LaurentMazare/ProjectEuler/blob/master/e166.c (written by Laurent Mazare)
Java github.com/HaochenLiu/My-Project-Euler/blob/master/166.java (written by Haochen Liu)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p166.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem166.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem166.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/166.nb
Haskell github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p166.hs (written by Nayuki)
Perl github.com/shlomif/project-euler/blob/master/project-euler/166/euler-166.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 |
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 |
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 165 - Intersections | Number Rotations - problem 168 >> |