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

id	challengeType	title	videoUrl	localeTitle
5900f4d01000cf542c50ffe3	5	Problem 356: Largest roots of cubic polynomials		问题356：三次多项式的最大根

Description

设a是多项式的最大实根g（x）= x3 - 2n·x2 + n。例如，a2 = 3.86619826 ......

找到最后八位数字。

注意：代表楼层功能。

Instructions

Tests

tests:
  - text: <code>euler356()</code>应该返回28010159。
    testString: 'assert.strictEqual(euler356(), 28010159, "<code>euler356()</code> should return 28010159.");'

Challenge Seed

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

euler356();

Solution

// solution required