freeCodeCamp/problem-409-nim-extreme.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

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

1.1 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5061000cf542c510017	5	false	Problem 409: Nim Extreme	302077

Description

Let n be a positive integer. Consider nim positions where:There are n non-empty piles. Each pile has size less than 2n. No two piles have the same size. Let W(n) be the number of winning nim positions satisfying the above conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.

Find W(10 000 000) mod 1 000 000 007.

Instructions

Tests

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

Challenge Seed

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

euler409();

Solution

// solution required

1.1 KiB Raw Blame History