Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-356-largest-roots-of-cubic-polynomials.chinese.md

56 lines
933 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f4d01000cf542c50ffe3
challengeType: 5
title: 'Problem 356: Largest roots of cubic polynomials'
videoUrl: ''
localeTitle: 问题356三次多项式的最大根
---
## Description
<section id="description">设a是多项式的最大实根gx= x3 - 2n·x2 + n。例如a2 = 3.86619826 ...... <p>找到最后八位数字。 </p><p>注意:代表楼层功能。 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler356()</code>应该返回28010159。
testString: 'assert.strictEqual(euler356(), 28010159, "<code>euler356()</code> should return 28010159.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler356() {
// Good luck!
return true;
}
euler356();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>