freeCodeCamp/problem-119-digit-power-sum.chinese.md at 0bbbd16aa9a709a2622a8f22cc6dfb0dcb772fa5

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.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3e41000cf542c50fef6	5	Problem 119: Digit power sum		问题119：数字功率总和

Description

数字512很有意思，因为它等于它的数字加到某个幂的总和：5 + 1 + 2 = 8，而83 = 512.具有这个属性的数字的另一个例子是614656 = 284.我们将定义一个成为这个序列的第n个术语，并坚持一个数字必须包含至少两个数字才能得到一个总和。给出a2 = 512和a10 = 614656。找到a30。

Instructions

Tests

tests:
  - text: <code>euler119()</code>应该返回248155780267521。
    testString: assert.strictEqual(euler119(), 248155780267521);

Challenge Seed

function euler119() {
  // Good luck!
  return true;
}

euler119();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape