ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
49 lines
1.0 KiB
Markdown
49 lines
1.0 KiB
Markdown
---
|
|
id: 5900f4e01000cf542c50fff2
|
|
title: 'Problem 371: Licence plates'
|
|
challengeType: 5
|
|
forumTopicId: 302033
|
|
dashedName: problem-371-licence-plates
|
|
---
|
|
|
|
# --description--
|
|
|
|
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.
|
|
|
|
# --hints--
|
|
|
|
`euler371()` should return 40.66368097.
|
|
|
|
```js
|
|
assert.strictEqual(euler371(), 40.66368097);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler371() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler371();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|