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>
47 lines
1.5 KiB
Markdown
47 lines
1.5 KiB
Markdown
---
|
||
id: 5900f4251000cf542c50ff38
|
||
title: 问题185：数字思维
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-185-number-mind
|
||
---
|
||
|
||
# --description--
|
||
|
||
游戏Number Mind是众所周知的游戏Master Mind的变种。而不是彩色钉，你必须猜测一个秘密的数字序列。在每次猜测之后，你只会告诉你猜对了多少个正确的数字。所以，如果序列是1234并且你猜到了2036，那么你会被告知你有一个正确的数字;但是，你不会被告知你在错误的地方也有另一个数字。
|
||
|
||
例如，给出以下5位秘密序列的猜测，90342; 2正确70794; 0正确39458; 2正确34109; 1正确51545; 2正确12531; 1正确正确序列39542是唯一的。
|
||
|
||
基于以下猜测，
|
||
|
||
5616185650518293 2正确3847439647293047 1正确5855462940810587 3正确9742855507068353 3正确4296849643607543 3正确3174248439465858 1正确4513559094146117 2正确7890971548908067 3正确8157356344118483 1正确2615250744386899 2正确8690095851526254 3正确6375711915077050 1正确6913859173121360; 1更正6442889055042768; 2更正2321386104303845; 0更正2326509471271448; 2更正5251583379644322; 2更正1748270476758276; 3更正4895722652190306; 1更正3041631117224635; 3更正1841236454324589; 3更正2659862637316867; 2更正
|
||
|
||
找到唯一的16位秘密序列。
|
||
|
||
# --hints--
|
||
|
||
`euler185()`应该返回4640261571849533。
|
||
|
||
```js
|
||
assert.strictEqual(euler185(), 4640261571849533);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler185() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler185();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|