freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-264-triangle-centre...

56 lines
1.4 KiB
Markdown
Raw Normal View History

---
id: 5900f4751000cf542c50ff87
challengeType: 5
videoUrl: ''
localeTitle: 问题264三角中心
---
## Description
<section id="description">考虑所有三角形格点上的所有顶点。原点O. Orthocentre在圆点H5,0处的圆环。有九个这样的三角形其周长≤50。按周长的升序列出并显示它们是 <p> A-4,3B5,0C4-3A4,3B5,0C-4-3A-3,4 B5,0C3-4A3,4B5,0C-3-4A0,5B5,0 C0-5A1,8B8-1C-4-7A8,1B1-8C - 4,7A2,9B9-2C-6-7A9,2B2-9C-6,7 </p><p>他们的周长总和四舍五入到小数点后四位是291.0089。 </p><p>查找周长≤105的所有此类三角形。输入其周长的总和四舍五入到小数点后四位。 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler264()</code>应该返回2816417.1055。
testString: assert.strictEqual(euler264(), 2816417.1055);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler264() {
// Good luck!
return true;
}
euler264();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>