<< problem 587 - Concave triangle | Marsh Crossing - problem 607 >> |
Problem 601: Divisibility streaks
(see projecteuler.net/problem=601)
For every positive number n we define the function streak(n)=k as the smallest positive integer k such that n+k is not divisible by k+1.
E.g:
13 is divisible by 1
14 is divisible by 2
15 is divisible by 3
16 is divisible by 4
17 is NOT divisible by 5
So streak(13)=4.
Similarly:
120 is divisible by 1
121 is NOT divisible by 2
So streak(120)=1
Define P(s,N) to be the number of integers n, 1<n<N, for which streak(n)=s.
So P(3,14)=1 and P(6,10^6)=14286
Find the sum, as i ranges from 1 to 31, of P(i,4^i).
My Algorithm
As always, I wrote a bruteForce
function to solve the examples.
The equations for streak(13) can be written as:
13 == 0 mod 1
(13+1) == 0 mod 2
(13+2) == 0 mod 3
(13+3) == 0 mod 4
(13+4) != 0 mod 5
Or in general for each streak(n)=6:
n == 0 mod 1
(n+1) == 0 mod 2
(n+2) == 0 mod 3
(n+3) == 0 mod 4
(n+4) == 0 mod 5
(n+5) == 0 mod 6
(n+6) != 0 mod 7
The equations become a lot simpler if I replace n by its predecessor m = n - 1:
(m+1) == 0 mod 1
(m+2) == 0 mod 2
(m+3) == 0 mod 3
(m+4) == 0 mod 4
(m+5) == 0 mod 5
(m+6) == 0 mod 6
(m+7) != 0 mod 7
Since (m + x) mod x is the same as m mod x I can write:
m == 0 mod 1
m == 0 mod 2
m == 0 mod 3
m == 0 mod 4
m == 0 mod 5
m == 0 mod 6
m != 0 mod 7
A number is divisible by 1,2,3,4,5,6 if it is a multiple of the least common multiple lcm(1,2,3,4,5,6) = 60.
Each n with a predecessor that is such a multiple is a solution to this problem.
Thus I could compute 4^i / lcm(1,2,3,...,i) but there is a catch: it includes longer streaks, too.
Therefore I need 4^i / lcm(1,2,3,...,i,i+1) as well because that's counting the numbers with these longer streaks.
All divisions need to be integer divisions, discarding any fractional digits.
It took me a few minutes figuring out that 1 and 4^i are NOT part of the range of valid numbers (therefore minus 2).
→ that's why I keep on writing those bruteForce()
function, they detect those anomalies easily.
For example:
P(6, 10^6) = \lfloor dfrac{10^6 - 2}{lcm(1,2,3,4,5,6)} \rfloor - \lfloor dfrac{10^6 - 2}{lcm(1,2,3,4,5,6,7)} \rfloor
P(6, 10^6) = \lfloor dfrac{999998}{60} \rfloor - \lfloor dfrac{999998}{420} \rfloor
P(6, 10^6) = 16666 - 2380
P(6, 10^6) = 14286
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho 10 | ./601
Output:
Note: the original problem's input 31
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>
// ---------- code from my toolbox ----------
// greatest common divisor
template <typename T>
T gcd(T a, T b)
{
while (a != 0)
{
T c = a;
a = b % a;
b = c;
}
return b;
}
// least common multiple
template <typename T>
T lcm(T a, T b)
{
// parentheses avoid overflows for certain input values
return a * (b / gcd(a, b));
}
// ---------- problem-specific code ----------
// count numbers up to limit with a given streak
unsigned long long bruteForce(unsigned long long limit, unsigned int streak)
{
unsigned long long result = 0;
for (unsigned long long i = 2; i < limit; i++)
{
unsigned int current = 1;
while ((i + current - 1) % current == 0)
current++;
// counted one too far (the number after the streak ended)
current--;
// correct streak ?
if (current == streak)
result++;
}
return result;
}
// find result faster than the blink of an eye ...
unsigned long long solve(unsigned long long limit, unsigned int streak)
{
// find least common multiple of 1..streak
unsigned long long multiple = streak;
for (unsigned long long i = 2; i < streak; i++)
multiple = lcm(multiple, i);
// each n - 1 which is a multiple of "multiple" is valid solution
limit--;
// the last number is excluded from the range, too
limit--;
auto atLeast = limit / multiple;
// but there are a few number with a longer streaks !
multiple = lcm(multiple, streak + 1ULL);
auto tooMany = limit / multiple;
// subtract them
return atLeast - tooMany;
}
int main()
{
//std::cout << bruteForce( 14, 3) << std::endl;
//std::cout << bruteForce(100, 6) << std::endl;
unsigned int limit = 31;
std::cin >> limit;
unsigned long long result = 0;
unsigned long long pow4 = 4;
for (unsigned int i = 1; i <= limit; i++)
{
//result += bruteForce(last, i);
result += solve(pow4, i);
pow4 *= 4;
}
// another problem solved !
std::cout << result << std::endl;
return 0;
}
This solution contains 15 empty lines, 18 comments and 1 preprocessor command.
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
October 10, 2017 submitted solution
October 10, 2017 added comments
Difficulty
Project Euler ranks this problem at 20% (out of 100%).
Links
projecteuler.net/thread=601 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python github.com/Meng-Gen/ProjectEuler/blob/master/601.py (written by Meng-Gen Tsai)
C++ github.com/smacke/project-euler/blob/master/python/601.py (written by Stephen Macke)
Sage github.com/roosephu/project-euler/blob/master/601.sage (written by Yuping Luo)
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 |
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 587 - Concave triangle | Marsh Crossing - problem 607 >> |