<< problem 93 - Arithmetic expressions | Amicable chains - problem 95 >> |
Problem 94: Almost equilateral triangles
(see projecteuler.net/problem=94)
It is easily proved that no equilateral triangle exists with integral length sides and integral area.
However, the almost equilateral triangle 5-5-6 has an area of 12 square units.
We shall define an almost equilateral triangle to be a triangle for which two sides are equal and the third differs by no more than one unit.
Find the sum of the perimeters of all almost equilateral triangles with integral side lengths and area and whose perimeters do not exceed one billion (1,000,000,000).
My Algorithm
I came up with two solutions:
1. a brute-force solution based on geometry which needs about 5 seconds to solve the problem (see findMore
)
2. a super-simple sequence based on "is there a pattern in the numbers of my brute-force approach ?" (see sequence
)
Let's start with algorithm 1:
The height in such a triangle with two equal sides is
h = sqrt{twoSides^2 - frac{oneSide^2}{4}}
Thus its area can be computed as
A = (oneSide/2) * h
= (oneSide/2) * sqrt{ twoSides^2 - frac{oneSide^2}{4}}
= (oneSide/2) * sqrt{4 twoSides^2 - oneSide^2}/2
2A = oneSide * sqrt{4 twoSides^2 - oneSide^2}
oneSide is always integral and 2A will be integral if the square root is integral, too,
that means that 4 * twoSides^2 - oneSide^2 must be a perfect square.
That's what my function isValidTriangle
is for.
findMore
looks for triangles with a perimeter between perimeter
and limit
.
It checks every possible triangle which makes it pretty slow.
I had a prototype that printed the lengths of all sides and their perimeter:
abcc - b (or a)perimeter
556+116
171716-150
656566+1196
241241240-1722
901901902+12704
336133613360-110082
125451254512546+137636
468174681746816-1140450
174725174725174724+1524176
...............
Obviously there is an alternating pattern in the difference between the length of the single side c and the other two sides a or b.
In the most unscientific way - plotting the numbers in Excel - I found that
a_n = 14a_{n-1} - a_{n-2} - 4 for all triangles where the single side is 1 unit shorter
a_n = 14a_{n-1} - a_{n-2} + 4 for all triangles where the single side is 1 unit longer
That's by no means something I can proof (and I don't intend to) but it gives the correct answers pretty much instantly. I can live with that ...
Modifications by HackerRank
The second approach solves all problems in less than 10 milliseconds, even for perimeters of 10^18 while
the brute-force approach fails for 2 out 7 test cases.
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 17" | ./94
Output:
Note: the original problem's input 1000
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 <cmath>
#include <vector>
#include <iostream>
// valid perimeters
std::vector<unsigned long long> solutions;
// return true if area is integral
bool isValidTriangle(unsigned long long oneSide, unsigned long long twoSides)
{
unsigned long long check = 4 * twoSides * twoSides - oneSide * oneSide;
unsigned long long root = sqrt(check);
return root * root == check;
}
// brute-force approach
unsigned long long findMore(unsigned long long perimeter, unsigned long long limit)
{
// check all perimeters
while (perimeter <= limit + 3)
{
// length of the two equal sides
auto twoSides = perimeter / 3;
// assume single side is one unit smaller than the other two sides
auto oneSide = twoSides - 1;
if (isValidTriangle(oneSide, twoSides))
solutions.push_back(perimeter - 1);
// assume single side is one unit bigger than the other two sides
oneSide = twoSides + 1;
if (isValidTriangle(oneSide, twoSides))
solutions.push_back(perimeter + 1);
// next group of triangles
perimeter += 3;
}
return perimeter;
}
// just compute sequence
unsigned long long sequence(unsigned long long limit)
{
// initial values of the equal sides
unsigned long long plusOne [] = { 1, 5 };
unsigned long long minusOne[] = { 1, 17 };
solutions.clear();
// smallest solutions where:
solutions.push_back(3 * plusOne [1] + 1); // single side is 1 unit longer than the equal sides
solutions.push_back(3 * minusOne[1] - 1); // single side is 1 unit shorter than the equal sides
while (solutions.back() <= limit + 3)
{
// compute next length of equal sides
unsigned long long nextPlusOne = 14 * plusOne [1] - plusOne [0] - 4;
unsigned long long nextMinusOne = 14 * minusOne[1] - minusOne[0] + 4;
// store it, shift off oldest values
plusOne [0] = plusOne [1];
plusOne [1] = nextPlusOne;
minusOne[0] = minusOne[1];
minusOne[1] = nextMinusOne;
// we are interested in the perimeter
solutions.push_back(3 * nextPlusOne + 1);
solutions.push_back(3 * nextMinusOne - 1);
}
// largest perimeter found
return solutions.back();
}
int main()
{
solutions.push_back(16); // perimeter of smallest triangle
unsigned long long perimeter = 18; // check 18-1 and 18+1 in next step
unsigned int tests = 1;
std::cin >> tests;
while (tests--)
{
unsigned long long limit = 1000000000;
std::cin >> limit;
// check all perimeters
while (perimeter <= limit + 3)
//perimeter = findMore(perimeter, limit);
perimeter = sequence(limit);
// sum of all relevant triangles
unsigned long long sum = 0;
for (auto x : solutions)
if (x <= limit)
sum += x;
std::cout << sum << std::endl;
}
return 0;
}
This solution contains 21 empty lines, 18 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
March 12, 2017 submitted solution
May 8, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler094
My code solves 7 out of 7 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 35% (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=94 - 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-94-almost-equilateral-triangles/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/094.cs (written by Haochen Liu)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-094.py (written by Hugh Brown)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p094.py (written by Nayuki)
Python github.com/smacke/project-euler/blob/master/python/94.py (written by Stephen Macke)
Python github.com/steve98654/ProjectEuler/blob/master/094.py
C++ github.com/Meng-Gen/ProjectEuler/blob/master/94.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/94.cpp (written by Yuping Luo)
C++ github.com/steve98654/ProjectEuler/blob/master/094.cpp
Java github.com/dcrousso/ProjectEuler/blob/master/PE094.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p094.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem94.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem094.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/094.nb
Scala github.com/samskivert/euler-scala/blob/master/Euler094.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/094-Almost-equilateral-triangles.pl (written by Gustaf Erikson)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p094.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 |
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 93 - Arithmetic expressions | Amicable chains - problem 95 >> |