<< problem 473 - Phigital number base | Double pandigital number divisible by 11 - problem 491 >> |
Problem 485: Maximum number of divisors
(see projecteuler.net/problem=485)
Let d(n) be the number of divisors of n.
Let M(n,k) be the maximum value of d(j) for n <= j <= n+k-1.
Let S(u,k) be the sum of M(n,k) for 1 <= n <= u-k+1.
You are given that S(1000, 10) = 17176.
Find S(100 000 000, 100 000).
My Algorithm
I needed to translate the short problem description into plain English (well, I'm German so actually it wasn't English ...):
to find S(1000, 10) I have to create 990 blocks with 10 elements each:
\{ d(1), d(2), ..., d(10) \},
\{ d(2), d(3), ..., d(11) \},
\{ d(3), d(4), ..., d(12) \},
...
\{ d(991), d(992), ..., d(1000) \}
and add the maximum values of all those 990 blocks.
My first step is to fill the container numDivisors
with d(1), d(2), ..., d(10^8).
The maximum value is 768 so an unsigned short
is sufficient - but it still requires 200 MByte RAM.
I implemented two algorithms to compute the number of divisors of n:
countDivisorsSlow
is based on trial division: it divides n by every number between 1 and n and counts how often the remainder is zero.
That's pretty fast if n is small (well, even 10^6 is almost okay) but much too slow for 10^8.
countDivisors
needs only one second to perform the same task:
if the number n is factorized into its prime factors n = {p_1}^e_1 * {p_2}^e_2 * {p_3}^e_3 * ...
then the number of divisors is d(n) = (e_1 + 1) * (e_2 + 1) * (e_3 + 1) * ...
My first step is to find all prime numbers below 10^8 (see below for a significant optimization / chapter "Note").
Then all d(n) are initialized with 1 and:
- iterate over all multiples m of 2^1 = 2, multiply d(m) by 1+1=2
- iterate over all multiples m of 2^2 = 4, multiply d(m) by 2+1=3 and divide by 1+1=2 (that's an undo of the previous step)
- iterate over all multiples m of 2^3 = 8, multiply d(m) by 3+1=4 and divide by 2+1=3 (that's an undo of the previous step)
- iterate over all multiples m of 2^4 = 16, multiply d(m) by 4+1=5 and divide by 3+1=4 (that's an undo of the previous step)
- ... and so on, until 2^x > 10^8
- repeat the same procedure for all other primes 3, 5, 7, 11, ...
- the obvious
bruteForce()
algorithm with two nested loops has 10^8 * 10^5 = 10^13 iterations and is too slow. - a smarter algorithm can do the same job in just 10^8 iterations !
search()
, each iteration updates mostRecent[d(n)]
with the current position n
(and enlarges mostRecent
if required).Zero is more or less a dummy element and the whole algorithm still works if I omit it but it simplifies index calculations a lot.
Only once it causes minor problems: the maximum number is the size of
mostRecent
minus 1.For example:
nd(n)mostRecent
00{ 0 }
11{ 0,1 }
22{ 0,1,2 }
32{ 0,1,3 }
43{ 0,1,3,4 }
52{ 0,1,5,4 }
64{ 0,1,5,4,6 }
72{ 0,1,7,4,6 }
84{ 0,1,7,4,8 }
93{ 0,1,7,9,8 }
104{ 0,1,7,9,10 }
If an element of
mostRecent
is too far away, that means if its value is more than blockSize
away from the current position, then it becomes invalid.That's only important for the largest indices of
mostRecent
: they will be removed, thus shrinking mostRecent
.
Alternative Approaches
The whole algorthm could be rewritten to process the data in chunks instead of all 100 million at once.
Memory consumption will drop considerably and I expect performance to remain about the same (maybe a tiny bit slower).
But the code size will grow considerably and become less reabable.
Note
d(n) is a large number if:
- n has many different prime factors or
- those prime factors have large exponents
- or both
such that d(73513440) = (5+1) * (3+1) * (1+1) * (1+1) * (1+1) * (1+1) * (1+1) = 6 * 4 * 2 * 2 * 2 * 2 * 2 = 768
In conclusion, pretty much every maximum d(n) of a block has typically very small prime factors.
Assuming that all prime factors of a maximum d(n) are less than sqrt{10^8} = 10^4, my code will still find the correct result for S(10^8, 10^5).
However, this "square-root" assumption isn't always true: it fails for S(1000, 10) (the problem is the small
blockSize
).The less primes I use as prime factors in
countDivisors
the faster the code becomes (at the risk of being off, depending on blockSize
).I manually looked for the smallest "valid" value for
primeLimit
for S(10^8, 10^5) and it turned out to be 107.Using this parameter cuts down the execution time from 1.8 to 1.1 seconds.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This is equivalent toecho "1000 10" | ./485
Output:
Note: the original problem's input 100000000 100000
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 <algorithm>
#include <cmath>
// store the number of divisors for the first 100 million numbers
typedef unsigned short Number; // => 200 MByte
std::vector<Number> numDivisors;
// slow trial division
void countDivisorsSlow(unsigned int limit)
{
// zero has no divisors
numDivisors = { 0 };
// process all numbers 1..10^8
for (unsigned int current = 1; current <= limit; current++)
{
Number count = 0;
// trial division of all numbers <= sqrt(current)
for (unsigned int divisor = 1; divisor*divisor <= current; divisor++)
{
// divisible ?
if (current % divisor != 0)
continue;
count++; // one divisor if i^2 = x
if (divisor*divisor != current) // or two if not (it's i and x/i)
count++;
}
numDivisors.push_back(count);
}
}
// similar to a prime sieve, much faster
void countDivisors(unsigned int limit, unsigned int primeLimit = 0)
{
numDivisors.resize(limit + 1, 1);
// zero has no divisors
numDivisors[0] = 0;
// accurate algorithm by default
if (primeLimit == 0)
primeLimit = limit;
// simple prime sieve (trial division because it has the shortest/most simple implementation)
std::vector<unsigned int> primes = { 2 };
for (unsigned int smallPrime = 3; smallPrime <= primeLimit; smallPrime += 2)
{
// find primes by trial division
bool isPrime = true;
for (auto p : primes)
if (smallPrime % p == 0)
{
isPrime = false;
break;
}
// yes, found another prime
if (isPrime)
primes.push_back(smallPrime);
}
// multiply all "simple" multiples of each prime by 2
// ... and multiply all multiples p^2 by 3
// ... and multiply all multiples p^3 by 4
// ... and so on
for (auto p : primes)
{
// "simple" multiples
for (auto i = p; i <= limit; i += p)
numDivisors[i] *= 2;
// multiples of p^2, p^3, ...
auto power = p * p;
auto exponent = 2;
while (power <= limit)
{
// undo the previous factor and multiply with "better" factor
for (auto i = power; i <= limit; i += power)
numDivisors[i] = (numDivisors[i] / exponent) * (exponent + 1);
// from to p^2 to p^3 to p^4 ...
power *= p;
exponent++;
}
}
}
// enough to verify the example ... (you need to fill numDivisors first)
unsigned long long bruteForce(unsigned int limit, unsigned int blockSize)
{
// for each range ...
unsigned long long result = 0;
for (unsigned int from = 1; from <= limit - blockSize + 1; from++)
{
// ... find its maximum
Number maximum = numDivisors[from];
for (unsigned int i = 1; i < blockSize; i++)
maximum = std::max(maximum, numDivisors[from + i]);
// and add it to the result
//std::cout << maximum << " ";
result += maximum;
}
return result;
}
// fast O(n) algorithm: a single pass iterating over all 10^8 elements of numDivisors (you need to fill numDivisors first)
unsigned long long search(unsigned int limit, unsigned int blockSize)
{
// store the most recent position a certain number of divisors was encountered
// actually the maximum is 768 divisors (first seen at 73513440)
std::vector<unsigned int> mostRecent;
// process number of divisors of the first block (10^5-1 elements)
for (unsigned int i = 0; i < blockSize; i++)
{
// new/updated maximum
auto current = numDivisors[i];
if (current >= mostRecent.size())
mostRecent.resize(current + 1, 0);
mostRecent[current] = i;
}
unsigned long long result = 0;
for (unsigned int i = blockSize; i <= limit; i++)
{
// remove "old" maximums
auto tooFar = i - blockSize;
while (!mostRecent.empty() && mostRecent.back() <= tooFar)
mostRecent.pop_back();
// new/updated maximum
auto current = numDivisors[i];
if (current >= mostRecent.size())
mostRecent.resize(current + 1, 0);
mostRecent[current] = i;
// highest index is equal to size-1
result += mostRecent.size() - 1;
}
return result;
}
int main()
{
unsigned int limit = 100000000; // 10^8
unsigned int blockSize = 100000; // 10^5
std::cin >> limit >> blockSize;
// compute number of divisors for all 100 million numbers
unsigned int primeLimit = limit;
// faster heuristic if possible, fails with small blockSize
if (blockSize >= 100)
primeLimit = sqrt(limit);
// lowest limit for default input: I found it by trial'n'error
if (limit == 100000000 && blockSize == 100000)
primeLimit = 107;
// compute number of divisors (might be off a little bit when primeLimit != limit)
countDivisors(limit, primeLimit);
// and now find S(10^8, 10^5)
//std::cout << bruteForce(limit, blockSize) << std::endl;
std::cout << search(limit, blockSize) << std::endl;
return 0;
}
This solution contains 25 empty lines, 39 comments and 4 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in 1.1 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
Peak memory usage was about 198 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
December 8, 2017 submitted solution
December 8, 2017 added comments
Difficulty
Project Euler ranks this problem at 30% (out of 100%).
Links
projecteuler.net/thread=485 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
C++ github.com/evilmucedin/project-euler/blob/master/euler485/485.cpp (written by Den Raskovalov)
Perl github.com/shlomif/project-euler/blob/master/project-euler/485/euler-485-v1.pl (written by Shlomi Fish)
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 |
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 473 - Phigital number base | Double pandigital number divisible by 11 - problem 491 >> |