397a9f0c3e
* fix: clean-up Project Euler 462-480 * fix: missing image extension * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
45 lines
877 B
Markdown
45 lines
877 B
Markdown
---
|
|
id: 5900f5481000cf542c51005b
|
|
title: 'Problem 476: Circle Packing II'
|
|
challengeType: 5
|
|
forumTopicId: 302153
|
|
dashedName: problem-476-circle-packing-ii
|
|
---
|
|
|
|
# --description--
|
|
|
|
Let $R(a, b, c)$ be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths $a$, $b$ and $c$.
|
|
|
|
Let $S(n)$ be the average value of $R(a, b, c)$ over all integer triplets $(a, b, c)$ such that $1 ≤ a ≤ b ≤ c < a + b ≤ n$.
|
|
|
|
You are given $S(2) = R(1, 1, 1) ≈ 0.31998$, $S(5) ≈ 1.25899$.
|
|
|
|
Find $S(1803)$ rounded to 5 decimal places behind the decimal point.
|
|
|
|
# --hints--
|
|
|
|
`circlePackingTwo()` should return `110242.87794`.
|
|
|
|
```js
|
|
assert.strictEqual(circlePackingTwo(), 110242.87794);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function circlePackingTwo() {
|
|
|
|
return true;
|
|
}
|
|
|
|
circlePackingTwo();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|