55 lines
1.3 KiB
Markdown
55 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f5071000cf542c510018
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 410: Circle and tangent line'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: ''
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## 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
|
|||
|
|
undefined
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: ''
|
|||
|
|
testString: 'assert.strictEqual(euler410(), 799999783589946600, "<code>euler410()</code> should return 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>
|