56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f4e11000cf542c50fff4
|
||
challengeType: 5
|
||
title: 'Problem 373: Circumscribed Circles'
|
||
videoUrl: ''
|
||
localeTitle: 问题373：外接圆圈
|
||
---
|
||
|
||
## Description
|
||
<section id="description">每个三角形都有一个穿过三个顶点的外接圆。考虑所有整数边三角形，其外接圆的半径也是整数。 <p>设S（n）是半径不超过n的所有这些三角形的外接圆的半径之和。 </p><p> S（100）= 4950并且S（1200）= 1653605。 </p><p>找到S（107）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler373()</code>应该返回727227472448913。
|
||
testString: 'assert.strictEqual(euler373(), 727227472448913, "<code>euler373()</code> should return 727227472448913.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler373() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler373();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|