<< problem 363 - Bézier Curves | Minimum of subsequences - problem 375 >> |
Problem 371: Licence plates
(see projecteuler.net/problem=371)
Oregon licence plates consist of three letters followed by a three digit number (each digit can be from [0..9]).
While driving to work Seth plays the following game:
Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.
E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip).
Find the expected number of plates he needs to see for a win.
Give your answer rounded to 8 decimal places behind the decimal point.
Note: We assume that each licence plate seen is equally likely to have any three digit number on it.
My Algorithm
The problem description tries hard to confuse the reader ... the plates' letters (e.g. RYU or SET) don't matter at all.
The only relevant part of a plate is its number. And I've never seen a leading zero on a plate - though it's possible according to the text.
In the end it doesn't matter as well.
A simple Monte-Carlo simulation can find the first digits (see monteCarlo()
):
- generate a random number
plate
- if
1000 - plate
was seen before then the game is over - add
plate
to the set of seen plates
(a) 500 can only be paired with a second 500
(b) 0 doesn't pair with any number
(c) all other numbers
The whole problem can be mapped to states (not the meaning "countries" but "character"):
- there are 499 pairs in group c → 499 states
- for each of those state there are two options: 500 wasn't seen or it was seen once
I decided to create two arrays
no500
and with500
, each with 499 elements (for a total of 998 values).And their state transitions:
- the "zero" plate (group b) doesn't change the current state
for each pair (x, y) where x + y = 1000 is doesn't matter whether x < y or x > y.
Therefore I assume that the first number of any pair in group c is always smaller than 500.
The exact numbers on the plates don't affect the result as long as they belong to group c: observing (12,430,299) is identical to (1,2,3).
In the end I am only concerned whether a plate's number is new (→ choose the next free number 1,2,3,...), is a duplicate or pairs with an existing number.
The probabilities are (assuming
have
denoted the number of unpaired plates in group c):(1) p_{new} = (998 - 2 * have) / 1000
(2) p_{finished} = have / 1000
(3) p_{duplicate} = have / 1000
(4) p_{zero} = 1 / 1000
(5) p_{500} = 1 / 1000
Stupid me needs to verify that I got everything right: 1 = p_{new} + p_{finished} + p_{duplicate} + p_{zero} + p_{500} → it's okay !
If I progress from one state to another then the expected value is
(6) E = 1 + p_{E_1} * E_1 + p_{E_2} * E_2 + p_{E_3} * E_3 + ...
I have to be careful with state transitions that lead back to the same state they started from:
(7) E = 1 + p_E * E
(8) E - p_E * E = 1
(9) E * (1 - p_E) = 1
(10) E = 1 / (1 - p_E)
→ e.g. assume I throw a fair coin p_E = 0.5 => E = 1 / (1 - 0.5) = 1 / 0.5 = 2 so I expect to need two attempts to see the other side
→ e.g. assume I throw a biased coin p_E = 0.6 that has a higher probability to show the last side => E = 1 / (1 - 0.6) = 1 / 0.4 = 2.5 attempts to see the other side
And the generalized equation is E = (1 + p_{E_1} * E_1 + p_{E_2} * E_2 + ...) / (1 - p_E)
I found it much easier to reverse the problem:
if I have seen all plates 1 to 499 (and there was no pair yet), then
1. there is a chance 1 / 1000 to see "zero"
2. there is a chance 499 / 1000 to see an old plate
3. there is a chance 499 / 1000 to finally see a matching plate
4. there is a chance 1 / 1000 to see "500"
The first two cases keep the player in its current state.
The game is won if case 3 happens-
If the current state includes that "500" was seen before, then the game is over, too.
If the current state includes that "500" was NOT seen before, then the state changes to "have500 with 499 plates".
Now the expected number for
have500[499]
is:(11) E_{499,have500} = 1 / (1 - (p_{zero} + p_{duplicate})) = 2
And
no500[499]
:(12) E_{499,no500} = (1 + 1/1000 * E_{499,have500}) / (1 - (p_{zero} + p_{duplicate})) = 2.4
Now E_{498,have500} can be computed by using the probabilities of staying in the current state and both state transitions (finish or advance to 499 plates).
With similar argument E_{498,no500} depends only on E_{498,have500} and E_{499,no500}.
A
for
-loop computes all values.Initially, the player hasn't seen a plate at all. That means E_{0,no500} is the result.
Alternative Approaches
A Dynamic Programming approach sounds viable but I highly doubt it can match the efficiency of the plain for
-loop.
Note
search()
computes bad results if the number of plates is odd because then there is no equivalent to the unique features of the "500" plates.
It took me a few minutes to realize that "zero" is special: first, I didn't think it's a valid plate number at all and second, I'm dumb. Sad but true ...
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 | ./371
Output:
Note: the original problem's input 1000
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 <iomanip>
#include <vector>
// a simple pseudo-random number generator
// (produces the same result no matter what compiler you have - unlike rand() from math.h)
unsigned int myrand()
{
// copied from problem 227
static unsigned long long seed = 0;
seed = 6364136223846793005ULL * seed + 1;
return (unsigned int)(seed >> 30);
}
// simulate random journeys ...
double monteCarlo(unsigned int numPlates, unsigned int iterations)
{
unsigned int numPlatesSeen = 0;
for (unsigned int i = 0; i < iterations; i++)
{
// true if plate was seen
std::vector<bool> seen(numPlates, false);
while (true)
{
// generate a new plate
auto plate = myrand() % numPlates;
numPlatesSeen++;
// look for matching plate (so that sum is 1000)
if (plate != 0) // 0 isn't matched by any other plate
{
auto other = numPlates - plate;
if (seen[other])
break;
}
// mark current plate as "seen"
seen[plate] = true;
}
}
return numPlatesSeen / double(iterations);
}
// and now smarter, faster, more precise ...
double search(unsigned int numPlates)
{
// how I compute the expected number:
// E = 1 + fail * E
// E - fail * E = 1
// E * (1 - fail) = 1
// E = 1 / (1 - fail)
// if there is another state transition E2 then with similar argument
// E = 1 + fail * E + good * E2
// E = (1 + good * E2) / (1 - fail)
// Seth may observe at most 499 "ordinary" plates
// => zero and 500 are "special"
const auto maxHave = numPlates / 2 - 1;
// several times I have to divide by numPlates and have to make sure the result is a double,
// so let's convert it to double once and keep using plates instead of numPlates from here on
const double plates = numPlates; // actually I thought about invPlates = 1 / double(numPlates)
// track expected number of plates you still have to see if n unpaired plates were already observed
// there is a significant difference whether the "500" plate was seen or not !
std::vector<double> have500(maxHave + 1, 0);
std::vector<double> no500 (maxHave + 1, 0);
// probabilities:
// observe an "old" plate, nothing changes (but the expected number)
auto probDuplicate = maxHave / plates;
// observe a "000" plate, nothing changes (but the expected number)
auto probZero = 1 / plates;
// observe a "500" plate, stop if already saw a "500", otherwise store it
auto prob500 = 1 / plates;
// solve the base case: all 499 plates already seen
// compute probability that the next plate still doesn't finish the game
auto probUnchanged = probDuplicate + probZero;
// now find expected number in case Seth 499 plates plus the "500" plate
have500[maxHave] = 1 / (1 - probUnchanged);
// and find expected number in case Seth 499 plates BUT NOT the "500" plate
no500 [maxHave] = (1 + prob500 * have500[maxHave]) / (1 - probUnchanged);
// continue the computation for 498, 497, ..., 1, 0 observed plates
for (int have = maxHave - 1; have >= 0; have--)
{
// determine number of unpaired plates (exclude zero and 500)
auto numNew = plates - 2*have - 2;
// probability that the plate wasn't seen before but pairs with no other plate yet
auto probNew = numNew / plates;
// it becomes less probable to see an "old" plate ...
probDuplicate = have / plates; // same as probDuplicate -= 1 / plates
probUnchanged = probDuplicate + probZero; // same as probUnchanged += 1 / plates
// same as above: E = (1 + good * E2) / (1 - fail)
have500[have] = (1 + probNew * have500[have + 1]) / (1 - probUnchanged);
no500 [have] = (1 + prob500 * have500[have] + probNew * no500 [have + 1]) / (1 - probUnchanged);
}
// no plate seen yet, not even "500"
return no500[0];
}
int main()
{
unsigned int numPlates = 1000;
std::cin >> numPlates;
std::cout << std::fixed << std::setprecision(8);
std::cout << search(numPlates) << std::endl;
// run simulation
//while (true)
//std::cout << monteCarlo(numPlates, 1000000) << std::endl;
return 0;
}
This solution contains 20 empty lines, 40 comments and 3 preprocessor commands.
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
September 21, 2017 submitted solution
September 21, 2017 added comments
Difficulty
Project Euler ranks this problem at 30% (out of 100%).
Links
projecteuler.net/thread=371 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
Python blog.dreamshire.com/project-euler-371/ (written by Mike Molony)
Python github.com/Meng-Gen/ProjectEuler/blob/master/371.py (written by Meng-Gen Tsai)
Python github.com/smacke/project-euler/blob/master/cpp/371.py (written by Stephen Macke)
Python github.com/smacke/project-euler/blob/master/python/371.py (written by Stephen Macke)
C++ github.com/roosephu/project-euler/blob/master/371.cpp (written by Yuping Luo)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem371.java (written by Magnus Solheim Thrap)
Mathematica github.com/frrad/project-euler/blob/master/mathematica/Problem371.m (written by Frederick Robinson)
Mathematica github.com/steve98654/ProjectEuler/blob/master/371.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 |
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 363 - Bézier Curves | Minimum of subsequences - problem 375 >> |