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

56 lines
1.2 KiB
Markdown
Raw Normal View History

---
id: 5900f43e1000cf542c50ff50
challengeType: 5
title: 'Problem 210: Obtuse Angled Triangles'
videoUrl: ''
localeTitle: 'Problema 210: Triângulos Angulares Obturados'
---
## Description
<section id="description"> Considere o conjunto S (r) de pontos (x, y) com coordenadas inteiras satisfazendo | x | + | y | ≤ r. Seja O o ponto (0,0) e C o ponto (r / 4, r / 4). Seja N (r) o número de pontos B em S (r), de forma que o triângulo OBC tenha um ângulo obtuso, isto é, o maior ângulo α satisfaça 90 ° &lt;α &lt;180 °. Então, por exemplo, N (4) = 24 e N (8) = 100. <p> O que é N (1.000.000.000)? </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler210()</code> deve retornar 1598174770174689500.
testString: 'assert.strictEqual(euler210(), 1598174770174689500, "<code>euler210()</code> should return 1598174770174689500.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler210() {
// Good luck!
return true;
}
euler210();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>