<< problem 90 - Cube digit pairs | Square digit chains - problem 92 >> |
Problem 91: Right triangles with integer coordinates
(see projecteuler.net/problem=91)
The points P(x1,y1) and Q(x2,y2) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form a triangle \triangle OPQ.
There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive;
that is, 0 <= x1, y1, x2, y2 <= 2.
Given that 0 <= x1, y1, x2, y2 <= 50, how many right triangles can be formed?
My Algorithm
The location of O was fixed at (0,0) but P and Q can be anywhere (but O!=P!=Q).
To simplify my algorithm I define that the right angle is always at O or P and never at Q.
The size of the grid is 50x50, each side has length size=50.
I identified 4 cases:
1. The right angle is at the origin O. P and Q can be anywhere on the x-/y-axis:
P(0<p_x<=size, 0) and Q(0, 0<q_y<=size) → that's size^2 different triangles.
2. The right angle is on the x-axis at P(0<p_x<=size, 0). Any Q with the same x-value makes a valid triangle:
P(0<p_x<=size, 0) and Q(p_x, 0<q_y<=size) → that's size^2 different triangles.
3. The right angle is on the y-axis at P(0, 0<p_y<=size). Any Q with the same y-value makes a valid triangle:
P(0, 0<p_y<=size) and Q(0<q_x<=size, p_y) → that's size^2 different triangles.
4. The right angle is "inside" the grid at P(0<p_x<=size, 0<p_y<=size).
The fourth case is a more challenging case and will be discussed in detail:
The right angle is enclosed by two vectors \vec{a} = \vec{PO} and \vec{b} = \vec{PQ}.
If they are perpendicular \vec{a} \bot \vec{b}, then their dot product is zero: \vec{a} \cdotp \vec{b} = a_{x}b_x + a_{y}b_y = 0
The task is to find for a given point P(p_x, p_y) each Q(q_x, q_y) such that p_x(q_x - p_x) + p_y(q_y - p_y) = 0.
For example P(2,2) and Q(3,1) create a valid right angle:
p_x(q_x - p_x) + p_y(q_y - p_y) = 2(3-2) + 2(1-2) = 2 - 2 = 0
The dot product can be transformed to
p_x(q_x - p_x) = -p_y(q_y - p_y)
This formula is obivously true for q_x = p_x and q_y = p_y.
Even more, it's also true for q_x = p_x + k \cdot p_y and q_y = p_y - k \cdot p_x (last line was just the special case k=0).
p_x(p_x + k p_y - p_x) = -p_y(p_y - k p_x - p_y)
p_x(k p_y) = -p_y(-k p_x)
kp_{x}p_y = kp_{x}p_y
Two nested for
-loops produce all integer combinations of 0 < p_x <= size and 0 < p_y <= size.
We only want integer solutions for q_x and q_y, too.
But if k is an integer, too, then we would miss some valid Q - e.g. for P(2,2) and Q(3,1) it follows that k=frac{1}{2}.
We get all integer solutions if k is a multiple of dfrac{1}{gcd(p_x,p_y)} (the Greatest Common Divisor, see en.wikipedia.org/wiki/Greatest_common_divisor)
For P(2,2) we get dfrac{1}{gcd(2,2)}=dfrac{1}{2}
Enough mathematics, let's dive into the code ... cases 1 to 3 don't need much of an explanation.
Then follows two nested for
-loop that analyze each P(p_x,p_y) of case 4.
factor
is the gcd(p_x,p_y)
such that k_{n+1} = k_n + 1/factor
The point Q is found by repeated adding p_y/factor
to p_x
and subtracting p_x/factor
from p_y
(for k > 0)
until any coordinate leaves the grid. The same procedure is done with inverse sign for k < 0.
A simple speed-up was achieved by observing that the number of valid Q is the same for P(p_x, p_y) and P(p_y, p_x).
That means that the two nested loops only need to considered the bottom-right triangle of the grid: P(p_x, p_y<=p_x).
For P(p_x, p_y<p_x) I multiply the number of Qs by 2 - but not when p_x=p_y.
Alternative Approaches
Most other solutions replace my inner-most while
-loops by a closed formula:
min(y * factor / x, (size - x) * factor / y) * 2
Noone really explains that formula and surprisingly it isn't faster on my machine for size <= 2500
.
The original problem can be solved by brute-force, too (four nested loops for p_x
, p_y
, q_x
, q_y
).
Modifications by HackerRank
Grids can have an edge length of up to 2500.
The brute-force approach fails of course (time-out) while my code finishes in less than 0.22 seconds.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 2 | ./91
Output:
Note: the original problem's input 50
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++ and can be compiled with G++, Clang++, Visual C++. You can download it, too. Or just jump to my GitHub repository.
#include <iostream>
#include <algorithm>
// greatest common divisor
unsigned int gcd(unsigned int a, unsigned int b)
{
while (a != 0)
{
unsigned int c = a;
a = b % a;
b = c;
}
return b;
}
int main()
{
unsigned int size = 50;
std::cin >> size;
// triangles where right angle is in the origin
unsigned int result = size*size;
// plus triangles where the right angle is located on the x-axis
result += size*size;
// plus triangles where the right angle is located on the y-axis
result += size*size;
// now all triangles where the right angle at point P(x > 0, y <= x)
// that's the triangle in the bottom-right half, denoted by slashes
// ^ /
// | //
// | ///
// |////
// +--->
for (unsigned int p_x = 1; p_x <= size; p_x++)
for (unsigned int p_y = 1; p_y <= p_x; p_y++)
{
// reduce to a proper fraction
unsigned int factor = gcd(p_x, p_y);
unsigned int deltaX = p_x / factor;
unsigned int deltaY = p_y / factor;
unsigned int found = 0;
// assume Q is "below" P
int q_x = p_x - deltaY;
int q_y = p_y + deltaX;
while (q_x >= 0 && q_y <= (int)size)
{
found++;
q_x -= deltaY;
q_y += deltaX;
}
// assume Q is "above" P
q_x = p_x + deltaY;
q_y = p_y - deltaX;
while (q_y >= 0 && q_x <= (int)size)
{
found++;
q_x += deltaY;
q_y -= deltaX;
}
// mirror along y=x when p_y < p_x
if (p_x != p_y)
found *= 2;
result += found;
}
std::cout << result << std::endl;
return 0;
}
This solution contains 13 empty lines, 15 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
March 15, 2017 submitted solution
May 10, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler091
My code solves 11 out of 11 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 25% (out of 100%).
Hackerrank describes this problem as medium.
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=91 - 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-91-right-angle-triangles-quadrant/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/091.cs (written by Haochen Liu)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-091.py (written by Hugh Brown)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p091.py (written by Nayuki)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/91.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/91.cpp (written by Yuping Luo)
C++ github.com/zmwangx/Project-Euler/blob/master/091/091.cpp (written by Zhiming Wang)
Java github.com/dcrousso/ProjectEuler/blob/master/PE091.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p091.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem91.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem091.go (written by Frederick Robinson)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p091.mathematica (written by Nayuki)
Mathematica github.com/steve98654/ProjectEuler/blob/master/091.nb
Haskell github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p091.hs (written by Nayuki)
Clojure github.com/rm-hull/project-euler/blob/master/src/euler091.clj (written by Richard Hull)
Scala github.com/samskivert/euler-scala/blob/master/Euler091.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/091-Right-triangles-with-integer-coordinates.pl (written by Gustaf Erikson)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p091.rs
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 | 715 | 716 | 717 | 718 | 719 | 720 | 721 |
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 90 - Cube digit pairs | Square digit chains - problem 92 >> |