56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
---
|
||
id: 5900f4241000cf542c50ff37
|
||
challengeType: 5
|
||
title: 'Problem 184: Triangles containing the origin'
|
||
videoUrl: ''
|
||
localeTitle: 问题184:包含原点的三角形
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑点(x,y)的集合Ir,其中半径为r的圆内部的整数坐标以原点为中心,即x2 + y2 <r2。对于半径为2,I2包含九个点(0,0),(1,0),(1,1),(0,1),( - 1,1),( - 1,0),( -1,-1),(0,-1)和(1,-1)。在I2中有八个三角形具有全部三个顶点,其中包含内部的原点。其中两个如下所示,其他通过旋转从这些中获得。 <p>对于半径为3,有360个三角形包含内部的原点并且所有顶点都在I3中,而对于I5,该数字是10600。 </p><p>有多少个三角形包含内部的原点并且在I105中包含所有三个顶点? </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler184()</code>应返回1725323624056。
|
||
testString: 'assert.strictEqual(euler184(), 1725323624056, "<code>euler184()</code> should return 1725323624056.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler184() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler184();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|