Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-310-nim-square.english.md
mrugesh 22afc2a0ca feat(learn): python certification projects (#38216)
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
2020-05-27 13:19:08 +05:30

65 lines
1.1 KiB
Markdown

---
id: 5900f4a21000cf542c50ffb5
challengeType: 5
isHidden: false
title: 'Problem 310: Nim Square'
forumTopicId: 301966
---
## Description
<section id='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.
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler310()</code> should return 2586528661783.
testString: assert.strictEqual(euler310(), 2586528661783);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler310() {
// Good luck!
return true;
}
euler310();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>