56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f53a1000cf542c51004c
|
||
challengeType: 5
|
||
title: 'Problem 461: Almost Pi'
|
||
videoUrl: ''
|
||
localeTitle: 问题461：几乎是Pi
|
||
---
|
||
|
||
## Description
|
||
<section id="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）。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler461()</code>应该返回159820276。
|
||
testString: 'assert.strictEqual(euler461(), 159820276, "<code>euler461()</code> should return 159820276.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler461() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler461();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|