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

60 lines
746 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f48f1000cf542c50ffa1
challengeType: 5
videoUrl: ''
title: 问题290数字签名
---
## Description
<section id="description">
多少个0≤n <1018的整数具有n的位数之和等于137n的位数之和的性质?
</section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler290()</code>应该返回20444710234716470。
testString: assert.strictEqual(euler290(), 20444710234716470);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler290() {
// Good luck!
return true;
}
euler290();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>