56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
id: 5900f4e01000cf542c50fff2
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 371: Licence plates'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题371:车牌
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">俄勒冈车牌由三个字母后跟一个三位数组成(每个数字可以是[0..9])。开车上班时,赛斯玩下面的游戏:每当他旅行中看到的两个牌照的数量增加到1000就是胜利。 <p>例如,MIC-012和HAN-988也是胜利,RYU-500和SET-500也是如此。 (只要他在同一次旅行中看到他们)。 </p><p>找到他想要获胜的预期牌照数量。将您的答案四舍五入到小数点后面的小数点后8位。 </p><p>注意:我们假设所看到的每个牌照同样可能有三位数字。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler371()</code>应返回40.66368097。
|
|||
|
testString: 'assert.strictEqual(euler371(), 40.66368097, "<code>euler371()</code> should return 40.66368097.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler371() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler371();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|