gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
07e665052db4724a4fb45f820722d8186ba5dbe5
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-290-digital-signature.chinese.md
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

792 B
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f48f1000cf542c50ffa1 5 Problem 290: Digital Signature 问题290：数字签名

Description

多少个0≤n <1018的整数具有n的位数之和等于137n的位数之和的性质？

Instructions

Tests

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

Challenge Seed

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

euler290();

Solution

// solution required