56 lines
996 B
Markdown
56 lines
996 B
Markdown
|
---
|
|||
|
|
id: 5900f4551000cf542c50ff68
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 233: Lattice points on a circle'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题233：圆上的格点
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">令f（N）是在通过（0,0），（N，0），（0，N）和（N，N）的圆上具有整数坐标的点的数量。可以证明f（10000）= 36。 <p>所有正整数N≤1011的总和是多少，f（N）= 420？ </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler233()</code>应该返回271204031455541300。
|
|||
|
|
testString: 'assert.strictEqual(euler233(), 271204031455541300, "<code>euler233()</code> should return 271204031455541300.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler233() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler233();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|