Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-438-integer-part-of-polynomial-equations-solutions.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

56 lines
1.3 KiB
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: 5900f5231000cf542c510034
challengeType: 5
title: 'Problem 438: Integer part of polynomial equation"s solutions'
videoUrl: ''
localeTitle: 问题438多项式方程解的整数部分
---
## Description
<section id="description">对于整数的n元组t =a1...anletx1...xn是多项式方程xn + a1xn-1 + a2xn-2 + ... +的解。 an-1x + an = 0。 <p>考虑以下两个条件x1...xn都是真实的。如果x1...xn被排序则⌊xi⌋= i1≤i≤n。 (⌊·⌋:地板功能。) </p><p>在n = 4的情况下有12个n元组的整数满足两个条件。我们将St定义为t中整数绝对值的总和。对于n = 4我们可以验证满足两个条件的所有n元组t的ΣSt= 2087。 </p><p>找到ΣSt为n = 7。 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler438()</code>应该返回2046409616809。
testString: assert.strictEqual(euler438(), 2046409616809);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler438() {
// Good luck!
return true;
}
euler438();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>