56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f50a1000cf542c51001c
|
||
challengeType: 5
|
||
title: 'Problem 413: One-child Numbers'
|
||
videoUrl: ''
|
||
localeTitle: 问题413:独生子女号码
|
||
---
|
||
|
||
## Description
|
||
<section id="description">我们说如果其子串中的一个子串可被d整除,则d位正数(无前导零)是一个子数。 <p>例如,5671是一个4位数的单子号码。在其所有子串5,6,7,1,56,67,71,567,671和5671中,只有56可被4整除。类似地,104是3位单子数,因为只有0可被整除3. 1132451是一个7位数的单子号码,因为只有245可被7整除。 </p><p>设F(N)是小于N的一子数的数。我们可以验证F(10)= 9,F(103)= 389和F(107)= 277674。 </p><p>找到F(1019)。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler413()</code>应该返回3079418648040719。
|
||
testString: 'assert.strictEqual(euler413(), 3079418648040719, "<code>euler413()</code> should return 3079418648040719.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler413() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler413();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|