freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-246-tangents-to-an-...

56 lines
1.2 KiB
Markdown
Raw Normal View History

---
id: 5900f4621000cf542c50ff75
challengeType: 5
title: 'Problem 246: Tangents to an ellipse'
videoUrl: ''
localeTitle: 问题246切线到椭圆
---
## Description
<section id="description">椭圆的定义是给定一个圆心c其中心为M半径为r点G为dGM <p>椭圆点的构造如下所示。 </p><p>给定的是M-2000,1500和G8000,1500。给定也是具有中心M和半径15000的圆c。与G和c等距的点的轨迹形成椭圆e。从外部的点P开始绘制两个切线t1和t2到椭圆。让t1和t2接触椭圆的点为R和S. </p><p>对于多少格点P角度RPS是否大于45度 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler246()</code>应该返回810834388。
testString: 'assert.strictEqual(euler246(), 810834388, "<code>euler246()</code> should return 810834388.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler246() {
// Good luck!
return true;
}
euler246();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>