freeCodeCamp

1.1 KiB

Raw Blame History

id	challengeType	title	forumTopicId
5900f4a21000cf542c50ffb5	5	Problem 310: Nim Square	301966

Description

Alice and Bob play the game Nim Square. Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap. The number of stones in the three heaps is represented by the ordered triple (a,b,c). If 0≤a≤b≤c≤29 then the number of losing positions for the next player is 1160.

Find the number of losing positions for the next player if 0≤a≤b≤c≤100 000.

Instructions

Tests

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

Challenge Seed

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

euler310();

Solution

// solution required

1.1 KiB Raw Blame History