<< problem 193 - Squarefree Numbers | Investigating the behaviour of a recursively ... - problem 197 >> |
Problem 196: Prime Triplets
(see projecteuler.net/problem=196)
Build a triangle from all positive integers in the following way:
1
23
456
78910
1112131415
161718192021
22232425262728
2930313233343536
373839404142434445
46474849505152535455
5657585960616263646566
. . .
Each positive integer has up to eight neighbours in the triangle.
A set of three primes is called a prime triplet if one of the three primes has the other two as neighbours in the triangle.
For example, in the second row, the prime numbers 2 and 3 are elements of some prime triplet.
If row 8 is considered, it contains two primes which are elements of some prime triplet, i.e. 29 and 31.
If row 9 is considered, it contains only one prime which is an element of some prime triplet: 37.
Define S(n) as the sum of the primes in row n which are elements of any prime triplet.
Then S(8)=60 and S(9)=37.
You are given that S(10000)=950007619.
Find S(5678027) + S(7208785).
My Algorithm
The last number of each row is a triangular number (en.wikipedia.org/wiki/Triangular_number):
getNumber
returns the number located in column x
and row y
based on the formula for triangular numbers.
= T(y-1) + x = dfrac{(y-1)(y-1+1)}{2} + x = dfrac{y(y-1)}{2} + x
A triplet always fits in a 3x3 group. However, the center of those 3x3 doesn't need to be located in row n:
row n can be the top row, the center row or the bottom row of a 3x3 group.
Thus I scan through all 3x3 groups which are centered around row n-1, n and n+1.
processLine
creates an array threePlus[]
which is true for x
if the 3x3 group centered around x
contains at least 3 primes.
The next step is to walk through row n and add the current number x
to the result if:
x
is a prime number- any 3x3 group centered in the 3x3 group of
x
hasthreePlus[] = true
Then I wrote a segmented prime sieve similar to what you can find on my website create.stephan-brumme.com/eratosthenes/ (I called it "block-wise" algorithm).
Note
My segmented sieve is a bitfield of all even numbers and its design follows the standard prime sieve from my toolbox.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho "8 9" | ./196
Output:
Note: the original problem's input 5678027 7208785
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>
#include <vector>
#include <cmath>
// ---------- standard prime sieve from my toolbox ----------
// note: a small tweak: fillSieve() aborts if sieve[] already has enough values
// odd prime numbers are marked as "true" in a bitvector
std::vector<bool> sieve;
// return true, if x is a prime number
bool isPrime(unsigned int x)
{
// handle even numbers
if ((x & 1) == 0)
return x == 2;
// lookup for odd numbers
return sieve[x >> 1];
}
// find all prime numbers from 2 to size
void fillSieve(unsigned int size)
{
// store only odd numbers
const unsigned int half = (size >> 1) + 1;
// already existing ?
if (sieve.size() >= half)
return;
// allocate memory
sieve.resize(half, true);
// 1 is not a prime number
sieve[0] = false;
// process all relevant prime factors
for (unsigned int i = 1; 2*i*i < half; i++)
// do we have a prime factor ?
if (sieve[i])
{
// mark all its multiples as false
unsigned int current = 3*i+1;
while (current < half)
{
sieve[current] = false;
current += 2*i+1;
}
}
}
// ---------- now problem-specific code ----------
// return number at position (x, y) where x <= y
unsigned long long getNumber(unsigned int x, unsigned int y)
{
// the last number in a line is a triangle number
// return x + T(y-1)
return x + y * (y - 1ULL) / 2;
}
std::vector<bool> segment;
unsigned long long segmentStart = 0;
// set segment[x] to true if x+from is prime
void fillSegmentedSieve(unsigned long long from, unsigned long long to)
{
// plain old sieve for all primes up to sqrt(to)
fillSieve(sqrt(to));
// first number covered by the segment
segmentStart = from | 1; // start with an odd number
// size of the segment
auto numValues = to - from + 1;
// assume all numbers are prime
segment.clear();
segment.resize(numValues + 1, true);
// cross off composites
for (unsigned long long p = 3; p*p <= to; p += 2)
if (isPrime(p))
{
// find smallest multiple in the segment
auto smallest = from - (from % p) + p;
// only odd multiples
if (smallest % 2 == 0)
smallest += p;
// walk through all odd multiples
for (size_t i = smallest; i <= to; i += 2*p)
segment[(i - segmentStart) / 2] = false;
}
}
// return true if number at position (x,y) is prime
// check boundaries, too (there parameter x can be negative)
bool isPrimeInSegment(int x, int y)
{
// out of bounds ?
if (x < 1 || x > y)
return false;
// check segmented sieve at that position
auto current = getNumber(x, y);
// reject all even number (except 2)
if (current % 2 == 0)
return current == 2;
// luokup
return segment[(current - segmentStart) / 2];
}
// return sum of all prime triplets in a certain line
unsigned long long processLine(unsigned int line)
{
// need to look two lines up and down
auto sieveFrom = getNumber(1, line - 2);
auto sieveTo = getNumber(1, line + 3) - 1;
// prevent line - 2 from becoming negative and producing strange results
if (line <= 2)
sieveFrom = 1;
// find all primes numbers for those 5 lines
fillSegmentedSieve(sieveFrom, sieveTo);
// find all primes with at least two direct neighbors that are prime, too
std::vector<bool> threePlus(segment.size(), false);
for (unsigned int y = line - 1; y <= line + 1; y++)
for (unsigned int x = 1; x <= y; x++)
{
// current number must be a prime
if (!isPrimeInSegment(x, y))
continue;
// count all primes in the 3x3 neighborhood (one step up,up-right,right,down-right,down, ...)
auto countPrimes = 0; // actually countPrimes is always at least 1 because there must be a prime at deltaX = deltaY = 0
for (int deltaX = -1; deltaX <= +1; deltaX++)
for (int deltaY = -1; deltaY <= +1; deltaY++)
if (countPrimes < 3 && isPrimeInSegment(x + deltaX, y + deltaY))
countPrimes++;
// at least three primes ?
threePlus[getNumber(x, y) - segmentStart] = (countPrimes >= 3);
}
// now look at the current line and compute sum of all triplets
unsigned long long sum = 0;
for (unsigned int x = 1; x <= line; x++)
{
// current number must be a prime
auto current = getNumber(x, line);
if (!isPrimeInSegment(x, line))
continue;
// look at 3x3 neighborhood whether at least one cell has threePlus[] = true
bool atLeastThree = false;
for (int deltaX = -1; deltaX <= +1; deltaX++)
for (int deltaY = -1; deltaY <= +1; deltaY++)
atLeastThree |= threePlus[getNumber(x + deltaX, line + deltaY) - segmentStart];
// found a triplet ?
if (atLeastThree)
sum += current;
}
return sum;
}
int main()
{
unsigned int one = 5678027;
unsigned int two = 7208785;
std::cin >> one >> two;
// fillSieve can re-use existing data if the second number not bigger than the first
if (one < two)
std::swap(one, two);
std::cout << processLine(one) + processLine(two) << std::endl;
return 0;
}
This solution contains 30 empty lines, 46 comments and 3 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.4 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
Peak memory usage was about 11 MByte.
(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
August 19, 2017 submitted solution
August 19, 2017 added comments
Difficulty
Project Euler ranks this problem at 65% (out of 100%).
Links
projecteuler.net/thread=196 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
C++ github.com/Meng-Gen/ProjectEuler/blob/master/196.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/196.cpp (written by Yuping Luo)
C github.com/LaurentMazare/ProjectEuler/blob/master/e196.c (written by Laurent Mazare)
Java github.com/HaochenLiu/My-Project-Euler/blob/master/196.java (written by Haochen Liu)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem196.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem196.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/196.nb
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 |
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 193 - Squarefree Numbers | Investigating the behaviour of a recursively ... - problem 197 >> |