freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-210-obtuse-angled-t...

41 lines
787 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f43e1000cf542c50ff50
title: 问题210钝角三角形
challengeType: 5
videoUrl: ''
dashedName: problem-210-obtuse-angled-triangles
---
# --description--
考虑点xy的集合Sr其中整数坐标满足| x | + | y | ≤r。设O为点0,0C为点r / 4r / 4。令Nr为Sr中的点B的数量使得三角形OBC具有钝角即最大角度α满足90°<α<180°。因此例如N4= 24并且N8= 100。
什么是N1,000,000,000
# --hints--
`euler210()`应该返回1598174770174689500。
```js
assert.strictEqual(euler210(), 1598174770174689500);
```
# --seed--
## --seed-contents--
```js
function euler210() {
return true;
}
euler210();
```
# --solutions--
```js
// solution required
```