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>
39 lines
564 B
Markdown
39 lines
564 B
Markdown
---
|
||
id: 5900f4181000cf542c50ff2b
|
||
title: 问题172：调查重复数字很少的数字
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-172-investigating-numbers-with-few-repeated-digits
|
||
---
|
||
|
||
# --description--
|
||
|
||
有多少个18位数字n（没有前导零），n中没有数字出现超过三次？
|
||
|
||
# --hints--
|
||
|
||
`euler172()`应返回227485267000992000。
|
||
|
||
```js
|
||
assert.strictEqual(euler172(), 227485267000992000);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler172() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler172();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|