freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-210-obtuse-angled-triangles.english.md

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f43e1000cf542c50ff50	5	Problem 210: Obtuse Angled Triangles	301852

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)?

Instructions

Tests

tests:
  - text: <code>euler210()</code> should return 1598174770174689500.
    testString: assert.strictEqual(euler210(), 1598174770174689500);

Challenge Seed

function euler210() {
  // Good luck!
  return true;
}

euler210();

Solution

// solution required