<< problem 110 - Diophantine reciprocals II | Bouncy numbers - problem 112 >> |
Problem 111: Primes with runs
(see projecteuler.net/problem=111)
Considering 4-digit primes containing repeated digits it is clear that they cannot all be the same:
1111 is divisible by 11, 2222 is divisible by 22, and so on.
But there are nine 4-digit primes containing three ones:
1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111
We shall say that M(n, d) represents the maximum number of repeated digits for an n-digit prime where d is the repeated digit,
N(n, d) represents the number of such primes, and S(n, d) represents the sum of these primes.
So M(4, 1) = 3 is the maximum number of repeated digits for a 4-digit prime where one is the repeated digit,
there are N(4, 1) = 9 such primes, and the sum of these primes is S(4, 1) = 22275.
It turns out that for d = 0, it is only possible to have M(4, 0) = 2 repeated digits, but there are N(4, 0) = 13 such cases.
In the same way we obtain the following results for 4-digit primes.
Digit dM(4,d)N(4,d)S(4,d)
021367061
13922275
2312221
331246214
4328888
5315557
6316661
73957863
8318887
93748073
For d = 0 to 9, the sum of all S(4, d) is 273700.
Find the sum of all S(10, d).
My Algorithm
search
iterates through all numbers and calls isPrime
to figure out whether it's a prime number.
There are a few gotchas:
1. While iterating, I create all possible strings. They may contain leading zeros, which are not allowed.
2. Add numbers into the sequence of repeated digits only if the number's digits are in non-decreasing order: 125 is okay, 122 is okay, 121 isn't.
Modifications by HackerRank
I should analyze numbers with up to 40 digits (instead of 10). My code is too slow to handle anything with more than 12 digits.
Even worse, my routines can't process numbers exceeding 64 bits (which is about 19 digits).
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 4 | ./111
Output:
Note: the original problem's input 10
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.
The code contains #ifdef
s to switch between the original problem and the Hackerrank version.
Enable #ifdef ORIGINAL
to produce the result for the original problem (default setting for most problems).
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define ORIGINAL
// return true if x is prime, based on trial division (not suitable for large numbers)
bool isPrime(unsigned long long x)
{
// trial divison by 2
if (x % 2 == 0)
return x == 2;
// trial division by odd numbers
for (unsigned long long i = 3; i*i <= x; i++)
if (x % i == 0)
return false;
return true;
}
// find all numbers where "digit" is repeated "repeat" times and "extraDigits" digits are added
// e.g. 10007 is found by search(0, 3, 2)
unsigned long long search(unsigned int digit, unsigned int repeat, unsigned int extraDigits, bool printPrimes = false)
{
// sum of all matching primes
unsigned long long sum = 0;
std::vector<unsigned long long> matches; // Hackerrank only: print matches in ascending order
// create string with a digit repeated a few times
std::string sameDigit(repeat, digit + '0');
// insert numbers i where 0 <= i < maxExtra
// e.g. if extraDigits = 3 then from 0 to 999 (actually from "000" to "999")
unsigned long long maxExtra = 1;
for (unsigned int i = 1; i <= extraDigits; i++)
maxExtra *= 10;
// let's insert all those numbers !
for (unsigned long long extra = 0; extra < maxExtra; extra++)
{
// convert to string
auto current = std::to_string(extra);
// is in ascending order ?
auto sorted = current;
std::sort(sorted.begin(), sorted.end());
if (current != sorted)
continue;
// add zeros if "extra" has too few digits
while (current.size() < extraDigits)
current = '0' + current;
// and add the bunch of identical digits
current += sameDigit;
// sort everything to ensure that std::next_permutation works properly
std::sort(current.begin(), current.end());
do
{
// no leading zeros
if (current.front() == '0')
continue;
// no even numbers
if (current.back() % 2 == 0) // ASCII code of even digits is even, too
continue;
// is it a prime ?
unsigned long long num = std::stoll(current);
if (isPrime(num))
{
sum += num;
if (printPrimes)
matches.push_back(num);
}
} while (std::next_permutation(current.begin(), current.end()));
}
// Hackerrank only: print all primes we found
if (printPrimes && !matches.empty())
{
std::sort(matches.begin(), matches.end());
for (auto x : matches)
std::cout << x << " ";
}
return sum;
}
int main()
{
#ifdef ORIGINAL
// total number of digits
unsigned int digits = 10;
std::cin >> digits;
// sum of all matching primes
unsigned long long sum = 0;
// iterate over all repeated digits
for (unsigned int i = 0; i <= 9; i++)
{
// try to use as many repeated digits as possible
for (unsigned int repeated = digits - 1; repeated >= 1; repeated--)
{
auto insertDigits = digits - repeated;
auto found = search(i, repeated, insertDigits);
// found at least one prime ?
if (found > 0)
{
sum += found;
break;
}
}
}
std::cout << sum << std::endl;
#else
unsigned int tests;
std::cin >> tests;
while (tests--)
{
unsigned int digits;
unsigned int sameDigit;
std::cin >> digits >> sameDigit;
if (digits < 19) // my code can't handle > 64 bits at the moment
{
// iterate over all repeated digits
for (unsigned int repeated = digits - 1; repeated >= 1; repeated--)
{
auto insertDigits = digits - repeated;
if (search(sameDigit, repeated, insertDigits, true) > 0)
break;
}
}
std::cout << std::endl;
}
#endif
return 0;
}
This solution contains 23 empty lines, 25 comments and 8 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 0.08 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
May 17, 2017 submitted solution
May 17, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler111
My code solves 1 out of 20 test cases (score: 0%)
I failed 0 test cases due to wrong answers and 19 because of timeouts
Difficulty
Project Euler ranks this problem at 45% (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=111 - 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-111-10-digit-primes-repeated-digits/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/111.cs (written by Haochen Liu)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p111.py (written by Nayuki)
Python github.com/steve98654/ProjectEuler/blob/master/111.py
C++ github.com/Meng-Gen/ProjectEuler/blob/master/111.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/111.cpp (written by Yuping Luo)
C++ github.com/smacke/project-euler/blob/master/cpp/111.cpp (written by Stephen Macke)
C github.com/LaurentMazare/ProjectEuler/blob/master/e111.c (written by Laurent Mazare)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p111.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem111.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem111.go (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/111.nb
Scala github.com/samskivert/euler-scala/blob/master/Euler111.scala (written by Michael Bayne)
Perl github.com/shlomif/project-euler/blob/master/project-euler/111/euler-111.pl (written by Shlomi Fish)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p111.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 | 627 | 628 | 629 | 630 | 631 | 632 | 633 | 634 | 635 |
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 110 - Diophantine reciprocals II | Bouncy numbers - problem 112 >> |