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>
66 lines
1.8 KiB
Markdown
66 lines
1.8 KiB
Markdown
---
|
||
id: 594db4d0dedb4c06a2a4cefd
|
||
title: 巴贝奇问题
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: babbage-problem
|
||
---
|
||
|
||
# --description--
|
||
|
||
<p> <a href='https://en.wikipedia.org/wiki/Charles_Babbage' title='wp：Charles_Babbage'>Charles Babbage</a> ，展望他的分析引擎能解决的各种问题，给出了这个例子： </p><blockquote>什么是正方形以数字269,696结尾的最小正整数？ </blockquote><p> - 巴贝奇，致鲍登勋爵的信，1837年;见Hollingdale和Tootill， <i>电子计算机</i> ，第二版，1970年，p。 125。 </p><p>他认为答案可能是99,736，其平方是9,947,269,696;但他无法确定。 </p><p>任务是找出巴贝奇是否有正确的答案。 </p><p>实现一个函数来返回满足Babbage问题的最小整数。如果巴贝奇是对的，返回巴贝奇的号码。 </p>
|
||
|
||
# --hints--
|
||
|
||
`babbage`是一种功能。
|
||
|
||
```js
|
||
assert(typeof babbage === 'function');
|
||
```
|
||
|
||
`babbage(99736, 269696)`不应该返回99736（答案较小）。
|
||
|
||
```js
|
||
assert.equal(babbage(babbageAns, endDigits), answer);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --after-user-code--
|
||
|
||
```js
|
||
const babbageAns = 99736;
|
||
const endDigits = 269696;
|
||
const answer = 25264;
|
||
```
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function babbage(babbageNum, endDigits) {
|
||
|
||
return true;
|
||
}
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
function babbage(babbageAns, endDigits) {
|
||
const babbageNum = Math.pow(babbageAns, 2);
|
||
const babbageStartDigits = parseInt(babbageNum.toString().replace('269696', ''));
|
||
let answer = 99736;
|
||
|
||
// count down from this answer and save any sqrt int result. return lowest one
|
||
for (let i = babbageStartDigits; i >= 0; i--) {
|
||
const num = parseInt(i.toString().concat('269696'));
|
||
const result = Math.sqrt(num);
|
||
if (result === Math.floor(Math.sqrt(num))) {
|
||
answer = result;
|
||
}
|
||
}
|
||
|
||
return answer;
|
||
}
|
||
```
|