ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
47 lines
821 B
Markdown
47 lines
821 B
Markdown
---
|
||
id: 5900f43e1000cf542c50ff50
|
||
title: 'Problem 210: Obtuse Angled Triangles'
|
||
challengeType: 5
|
||
forumTopicId: 301852
|
||
dashedName: problem-210-obtuse-angled-triangles
|
||
---
|
||
|
||
# --description--
|
||
|
||
Consider the set S(r) of points (x,y) with integer coordinates satisfying |x| + |y| ≤ r.
|
||
|
||
Let O be the point (0,0) and C the point (r/4,r/4).
|
||
|
||
Let N(r) be the number of points B in S(r), so that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°<α<180°.
|
||
|
||
So, for example, N(4)=24 and N(8)=100.
|
||
|
||
What is N(1,000,000,000)?
|
||
|
||
# --hints--
|
||
|
||
`euler210()` should return 1598174770174689500.
|
||
|
||
```js
|
||
assert.strictEqual(euler210(), 1598174770174689500);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler210() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler210();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|