* 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>
78 lines
1.2 KiB
Markdown
78 lines
1.2 KiB
Markdown
---
|
||
id: 5900f37d1000cf542c50fe8f
|
||
title: 问题16:电源数字总和
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-16-power-digit-sum
|
||
---
|
||
|
||
# --description--
|
||
|
||
2 <sup>15<!-- sup-->= 32768,其位数之和为3 + 2 + 7 + 6 + 8 = 26。 2 <sup><code>指数<!-- code--><!-- sup-->的数字总和是多少?</code></sup></sup>
|
||
|
||
# --hints--
|
||
|
||
`powerDigitSum(15)`应该返回26。
|
||
|
||
```js
|
||
assert.strictEqual(powerDigitSum(15), 26);
|
||
```
|
||
|
||
`powerDigitSum(128)`应该返回166。
|
||
|
||
```js
|
||
assert.strictEqual(powerDigitSum(128), 166);
|
||
```
|
||
|
||
`powerDigitSum(1000)`应返回1366。
|
||
|
||
```js
|
||
assert.strictEqual(powerDigitSum(1000), 1366);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function powerDigitSum(exponent) {
|
||
|
||
return true;
|
||
}
|
||
|
||
powerDigitSum(15);
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
function powerDigitSum(exponent) {
|
||
const bigNum = [1];
|
||
let sum = 0;
|
||
|
||
for (let i = 1; i <= exponent; i++) {
|
||
let count = bigNum.length + 1;
|
||
let overflow = 0;
|
||
for (let j = 0; j < count; j++) {
|
||
let digit = bigNum[j] || 0;
|
||
digit = 2 * digit + overflow;
|
||
|
||
if (digit > 9) {
|
||
digit -= 10;
|
||
overflow = 1;
|
||
} else {
|
||
overflow = 0;
|
||
}
|
||
|
||
bigNum[j] = digit;
|
||
}
|
||
}
|
||
|
||
bigNum.forEach(function(num) {
|
||
return sum += num;
|
||
});
|
||
|
||
return sum;
|
||
}
|
||
```
|