freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-77-prime-summations...

56 lines
895 B
Markdown
Raw Normal View History

---
id: 5900f3b91000cf542c50fecc
challengeType: 5
title: 'Problem 77: Prime summations'
videoUrl: ''
localeTitle: 问题77总结
---
## Description
<section id="description">可以用五种不同的方式将十个作为素数之和7 + 3 5 + 5 5 + 3 + 2 3 + 3 + 2 + 2 2 + 2 + 2 + 2 + 2第一个值是多少可以用五千多种不同的方式写成素数之和 </section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler77()</code>应该返回71。
testString: 'assert.strictEqual(euler77(), 71, "<code>euler77()</code> should return 71.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler77() {
// Good luck!
return true;
}
euler77();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>