56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f5351000cf542c510047
|
||
challengeType: 5
|
||
title: 'Problem 456: Triangles containing the origin II'
|
||
videoUrl: ''
|
||
localeTitle: ''
|
||
---
|
||
|
||
## Description
|
||
<section id="description">定义:xn =(1248n mod 32323) - 16161yn =(8421n mod 30103) - 15051 Pn = {(x1,y1),(x2,y2),...,(xn,yn)} <p>例如,P8 = {( - 14913,-6630),( - 10161,5625),(5226,11889),(8340,-10778),(15852,-5203),( - 15165,11295),( - 1427,-14495),(12407,1060)}。 </p><p>设C(n)是顶点在Pn中的三角形的数量,其中包含内部的原点。 </p><p>示例:C(8)= 20 C(600)= 8950634 C(40 000)= 2666610948988 </p><p>找到C(2 000 000)。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler456()</code>应返回333333208685971500。
|
||
testString: 'assert.strictEqual(euler456(), 333333208685971500, "<code>euler456()</code> should return 333333208685971500.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler456() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler456();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|