freeCodeCamp/problem-324-building-a-tower.english.md at 1f310d8c5877a13cf67fbfaad323b4a558a0ac3c

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4b11000cf542c50ffc3	5	Problem 324: Building a tower

Description

Let f(n) represent the number of ways one can fill a 3×3×n tower with blocks of 2×1×1. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct. For example (with q = 100000007) :f(2) = 229,f(4) = 117805,f(10) mod q = 96149360,f(103) mod q = 24806056,f(106) mod q = 30808124.

Find f(1010000) mod 100000007.

Instructions

Tests

tests:
  - text: <code>euler324()</code> should return 96972774.
    testString: assert.strictEqual(euler324(), 96972774, '<code>euler324()</code> should return 96972774.');

Challenge Seed

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

euler324();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape