freeCodeCamp

1.2 KiB

Raw Blame History

id	challengeType	title	videoUrl	localeTitle
5900f5351000cf542c510047	5	Problem 456: Triangles containing the origin II		Problema 456: Triângulos contendo a origem II

Description

Defina: xn = (1248n mod 32323) - 16161yn = (8421n mod 30103) - 15051 Pn = {(x1, y1), (x2, y2), ..., (xn, yn)}

Por exemplo, P8 = {(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (- 1427, -14495), (12407, 1060)}.

Seja C (n) o número de triângulos cujos vértices estão em Pn que contêm a origem no interior.

Exemplos: C (8) = 20 C (600) = 8950634 C (40 000) = 2666610948988

Encontre C (2 000 000).

Instructions

Tests

tests:
  - text: ''
    testString: 'assert.strictEqual(euler456(), 333333208685971500, "<code>euler456()</code> should return 333333208685971500.");'

Challenge Seed

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

euler456();

Solution

// solution required

1.2 KiB Raw Blame History