freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-290-digital-signature.md

id, challengeType, videoUrl, localeTitle

id	challengeType	videoUrl	localeTitle
5900f48f1000cf542c50ffa1	5		问题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

/section>