freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-373-circumscribed-circles.md

---
id: 5900f4e11000cf542c50fff4
title: 'Problem 373: Circumscribed Circles'
challengeType: 5
forumTopicId: 302035
dashedName: problem-373-circumscribed-circles
---

# --description--

Every triangle has a circumscribed circle that goes through the three vertices.

Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.

Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.

S(100)=4950 and S(1200)=1653605.

Find S(107).

# --hints--

`euler373()` should return 727227472448913.

```js
assert.strictEqual(euler373(), 727227472448913);
```

# --seed--

## --seed-contents--

```js
function euler373() {

  return true;
}

euler373();
```

# --solutions--

```js
// solution required
```