fix(curriculum): clean-up Project Euler 301-320 (#42926)
* fix: clean-up Project Euler 301-320 * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
@ -12,18 +12,18 @@ 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).
|
||||
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.
|
||||
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.
|
||||
Find the number of losing positions for the next player if $0 ≤ a ≤ b ≤ c ≤ 100\\,000$.
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler310()` should return 2586528661783.
|
||||
`nimSquare()` should return `2586528661783`.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler310(), 2586528661783);
|
||||
assert.strictEqual(nimSquare(), 2586528661783);
|
||||
```
|
||||
|
||||
# --seed--
|
||||
@ -31,12 +31,12 @@ assert.strictEqual(euler310(), 2586528661783);
|
||||
## --seed-contents--
|
||||
|
||||
```js
|
||||
function euler310() {
|
||||
function nimSquare() {
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
euler310();
|
||||
nimSquare();
|
||||
```
|
||||
|
||||
# --solutions--
|
||||
|
Reference in New Issue
Block a user