ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
820 B
Markdown
45 lines
820 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--
|
|
|
|
`euler476()` should return 110242.87794.
|
|
|
|
```js
|
|
assert.strictEqual(euler476(), 110242.87794);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler476() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler476();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|