gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.md
View File

@ -1,30 +1,38 @@
---
id: 5900f37d1000cf542c50fe8f
title: 问题16：电源数字总和
title: 'Problem 16: Power digit sum'
challengeType: 5
videoUrl: ''
forumTopicId: 301791
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>
2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 2<sup><code>exponent</code></sup>?
# --hints--
`powerDigitSum(15)`应该返回26。
`powerDigitSum(15)` should return a number.
```js
assert(typeof powerDigitSum(15) === 'number');
```
`powerDigitSum(15)` should return 26.
```js
assert.strictEqual(powerDigitSum(15), 26);
```
`powerDigitSum(128)`应该返回166。
`powerDigitSum(128)` should return 166.
```js
assert.strictEqual(powerDigitSum(128), 166);
```
`powerDigitSum(1000)`应返回1366。
`powerDigitSum(1000)` should return 1366.
```js
assert.strictEqual(powerDigitSum(1000), 1366);