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>
39 lines
890 B
Markdown
39 lines
890 B
Markdown
---
|
||
id: 5900f53a1000cf542c51004c
|
||
title: 问题461：几乎是Pi
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-461-almost-pi
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于所有非负整数k，设fn（k）= ek / n-1。值得注意的是，f200（6）+ f200（75）+ f200（89）+ f200（226）= 3.141592644529 ...≈π。事实上，对于n = 200，它是fn（a）+ fn（b）+ fn（c）+ fn（d）形式的π的最佳近似值。设g（n）= a2 + b2 + c2 + d 2为a，b，c，d最小化错误：| fn（a）+ fn（b）+ fn（c）+ fn（d） - π| （其中| x |表示x的绝对值）。给出g（200）= 62 + 752 + 892 + 2262 = 64658.求g（10000）。
|
||
|
||
# --hints--
|
||
|
||
`euler461()`应该返回159820276。
|
||
|
||
```js
|
||
assert.strictEqual(euler461(), 159820276);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler461() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler461();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|