61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
63 lines
936 B
Markdown
63 lines
936 B
Markdown
---
|
||
id: 5900f49b1000cf542c50ffae
|
||
challengeType: 5
|
||
title: 'Problem 303: Multiples with small digits'
|
||
videoUrl: ''
|
||
localeTitle: 问题303：小数的倍数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
对于正整数n，将f（n）定义为n的最小正整数，以10为底的数字只能使用≤2的数字。
|
||
因此，f（2）= 2，f（3）= 12，f（7）= 21，f（42）= 210，f（89）= 1121222。
|
||
另外，。
|
||
|
||
找 。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler303()</code>应该返回1111981904675169。
|
||
testString: assert.strictEqual(euler303(), 1111981904675169);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler303() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler303();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|