freeCodeCamp/problem-324-building-a-tower.chinese.md at 3836ce08e39d6ece27ac70639d0fe871bcfbd63a

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4b11000cf542c50ffc3	5	Problem 324: Building a tower		问题324：建造一座塔楼

Description

设f（n）表示用2×1×1的块填充3×3×n塔的方式的数量。你可以以任何你喜欢的方式旋转块;然而，塔本身的旋转，反射等被视为不同的。例如（q = 100000007）：f（2）= 229，f（4）= 117805，f（10）mod q = 96149360，f（103）mod q = 24806056，f（106）mod q = 30808124。

求f（1010000）mod 100000007。

Instructions

Tests

tests:
  - text: <code>euler324()</code>应该返回96972774。
    testString: assert.strictEqual(euler324(), 96972774);

Challenge Seed

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

euler324();

Solution

// solution required

/section>

1.0 KiB Raw Blame History Unescape Escape