56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3d21000cf542c50fee5
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 102: Triangle containment'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题102：三角形遏制
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">在笛卡尔平面上随机绘制三个不同的点，其中-1000≤x，y≤1000，从而形成三角形。考虑以下两个三角形：A（-340,495），B（-153，-910），C（835，-947）X（-175,41），Y（-421，-714），Z（574， - 645）可以验证三角形ABC包含原点，而三角形XYZ不包含原点。使用triangles.txt（右键单击并将“Save Link / Target As ...”保存），包含一千个“随机”三角形坐标的27K文本文件，找到内部包含原点的三角形数。注意：文件中的前两个示例表示上面给出的示例中的三角形。 </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler102()</code>应该返回228。
|
|||
|
|
testString: 'assert.strictEqual(euler102(), 228, "<code>euler102()</code> should return 228.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler102() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler102();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|