freeCodeCamp/problem-30-digit-n-powers.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

1.5 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f38a1000cf542c50fe9d	5	Problem 30: Digit n powers		问题30：数字n次方

Description

令人惊讶的是，只有三个数字可以写为它们的数字的四次幂之和： 1634 = 1 ⁴ + 6 ⁴ + 3 ⁴ + 4 ⁴ 8208 = 8 ⁴ + 2 ⁴ + 0 ⁴ + 8 ⁴ 9474 = 9 ⁴ + 4 ⁴ + 7 ⁴ + 4 ⁴ 由于1 = 1 ⁴不是总和，因此不包括在内。这些数字的总和为1634 + 8208 + 9474 = 19316。找出所有可以写为数字n次幂的数字之和。

Instructions

Tests

tests:
  - text: <code>digitnPowers(2)</code>应该返回0。
    testString: assert(digitnPowers(2) == 0);
  - text: <code>digitnPowers(3)</code>应该返回1301。
    testString: assert(digitnPowers(3) == 1301);
  - text: <code>digitnPowers(4)</code>应该返回19316。
    testString: assert(digitnPowers(4) == 19316);
  - text: <code>digitnPowers(5)</code>应该返回443839。
    testString: assert(digitnPowers(5) == 443839);

Challenge Seed

function digitnPowers(n) {
  // Good luck!
  return n;
}

digitnPowers(5);

Solution

// solution required

1.5 KiB Raw Blame History Unescape Escape