56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f5071000cf542c510018
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题410：圆和切线
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设C为半径为r的圆，x2 + y2 = r2。我们选择两个点P（a，b）和Q（-a，c），使得穿过P和Q的线与C相切。 <p>例如，四元组（r，a，b，c）=（2,6,2，-7）满足该属性。 </p><p>令F（R，X）为具有该性质的整数四元组（r，a，b，c）的数量，并且0 <r≤R且0 <a≤X。 </p><p>我们可以验证F（1,5）= 10，F（2,10）= 52和F（10,100）= 3384.求F（108,109）+ F（109,108）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler410()</code>应该返回799999783589946600。
|
||
testString: assert.strictEqual(euler410(), 799999783589946600);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler410() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler410();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|