<< problem 50 - Consecutive prime sum | Permuted multiples - problem 52 >> |
Problem 51: Prime digit replacements
(see projecteuler.net/problem=51)
By replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.
By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers,
yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.
Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.
My Algorithm
In most regular expression languages, the single dot "."
indicates an arbitrary symbol.
Project Euler went with a star "*"
instead of a dot but it doesn't matter what placeholder you choose.
My program computes all prime numbers and then generates all regular expressions it can be matched against
(under the assumption that all dots are replaced by the same digit).
For example: 56003
can be matched against ".6003"
, "5.003"
, "56.03"
, "560.3"
, "56..3"
and "5600."
.
Now all we have to do is:
- find all relevant prime numbers
- for each prime number: find all regular expressions it can be matched against and add the prime to each regular expression's list
- find the list (of at least 8 numbers) with the smallest prime numbers
maxDigits
defines the total number of digits of each prime (56003
has 5 digits)replace
defines how many identical digits should be replacedsiblings
defines how many prime numbers can be matched against the regular expression (the original problem asks for 8)
matches
:its keys are the regular expressions while its values are the matching prime numbers.
The function
match
fills that data structure recursively.- it replaces all digits of
regex
which are equal todigit
by a dot but not more thanhowOften
times. - then it adds the current prime number
number
tomatches[regex]
- to speed up the program, the smallest prime number which fulfills all conditions is stored in
smallestPrime
Modifications by HackerRank
I failed one test case with timeouts: looking at my output I saw that all minimized families of 7-digit primes have members below 2000000 or 3000000.
That's a hack I'm not very proud of, but it gets the job done ...
The problem description wasn't very clear about it: a family of x primes is also a family of x-1 primes.
That means that the family of 7 prime numbers 56003, 56113, 56333, 56443, 56663, 56773, and 56993 is
also a family of 6 prime numbers (56003, 56113, 56333, 56443, 56663, 56773).
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho "5 2 7" | ./51
Output:
Note: the original problem's input 6 3 8
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 <vector>
#include <string>
#include <map>
#include <iostream>
// total number of digits
unsigned int maxDigits = 7;
// how many digits we replace by a pattern symbol
unsigned int replace = 3;
// how many primes that pattern match
unsigned int siblings = 7;
// [regular expression] => [prime numbers matching that expression]
std::map<std::string, std::vector<unsigned int>> matches;
// smallest family with the required number of siblings
unsigned int smallestPrime = 99999999;
// replace all combinations of "digit" by a dot (".") when it occurs at least "howOften"
void match(unsigned int number, std::string& regex, unsigned int digit, unsigned int howOften, unsigned int startPos = 0)
{
char asciiDigit = digit + '0';
// look for digit
for (unsigned int i = startPos; i < maxDigits; i++)
{
// keep going ...
if (regex[i] != asciiDigit)
continue;
// no leading zero
if (i == 0 && asciiDigit == '0')
continue;
// replace digit by placeholder
regex[i] = '.';
// replaced enough digits ?
if (howOften == 1)
{
auto& addTo = matches[regex];
addTo.push_back(number);
if (addTo.size() >= siblings && addTo.front() < smallestPrime)
smallestPrime = addTo.front();
}
else
{
// no, have to "go deeper"
match(number, regex, digit, howOften - 1, i + 1);
}
// restore digit
regex[i] = asciiDigit;
}
}
int main()
{
std::cin >> maxDigits >> replace >> siblings;
// find smallest number with maxDigits digits
unsigned int minNumber = 1;
for (unsigned int i = 1; i < maxDigits; i++)
minNumber *= 10;
// and the largest number
unsigned int maxNumber = minNumber * 10 - 1;
// basic prime sieve of Erastothenes
// bitmap of all prime numbers (primes[x] is true if x is prime)
std::vector<bool> primes(maxNumber, true);
primes[0] = primes[1] = false;
for (unsigned int i = 2; i*i <= maxNumber; i++)
if (primes[i])
// i is a prime, exclude all its multiples
for (unsigned j = 2*i; j <= maxNumber; j += i)
primes[j] = false;
// build regex
for (unsigned int i = minNumber; i <= maxNumber; i++)
if (primes[i])
{
// convert i to string
auto strNum = std::to_string(i);
// replace digits
for (unsigned int digit = 0; digit <= 9; digit++)
match(i, strNum, digit, replace);
// quick hack to speed up the program
if (maxDigits == 7)
{
// all relevant numbers were below thes thresholds on my local computer
if (replace == 1 && i > 2000000)
break;
if (replace == 2 && i > 3000000)
break;
}
}
// find lexicographically minimized "family"
std::string minimum;
for (auto m : matches)
{
// enough members ?
if (m.second.size() < siblings)
continue;
// minimized ?
if (m.second.front() != smallestPrime)
continue;
// convert all siblings to a long string
std::string s;
for (unsigned i = 0; i < siblings; i++)
s += std::to_string(m.second[i]) + " ";
// same minimum primes are part of multiple families, choose the lexicographically first
if (minimum > s || minimum.empty())
minimum = s;
}
// print best match
std::cout << minimum << std::endl;
return 0;
}
This solution contains 20 empty lines, 29 comments and 4 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.11 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
Peak memory usage was about 4 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
February 27, 2017 submitted solution
April 28, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler051
My code solves 21 out of 21 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 15% (out of 100%).
Hackerrank describes this problem as advanced.
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=51 - 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-51-eight-prime-family/ (written by Kristian Edlund)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-051.py (written by Hugh Brown)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p051.py (written by Nayuki)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/51.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/51.cpp (written by Yuping Luo)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p051.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem51.java (written by Magnus Solheim Thrap)
Javascript github.com/dsernst/ProjectEuler/blob/master/51 Prime digit replacements.js (written by David Ernst)
Go github.com/frrad/project-euler/blob/master/golang/Problem051.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/051.nb
Clojure github.com/rm-hull/project-euler/blob/master/src/euler051.clj (written by Richard Hull)
Scala github.com/samskivert/euler-scala/blob/master/Euler051.scala (written by Michael Bayne)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p051.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 |
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 |
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 50 - Consecutive prime sum | Permuted multiples - problem 52 >> |