Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

1.2 KiB
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f5241000cf542c510037 5 Problem 440: GCD and Tiling 问题440GCD和平铺

Description

我们要完全平铺一块长度为n且高度为1的板上面有1×2块或1×1块上面有一个十进制数字

例如以下是铺砌长度为n = 8的板的一些方法

令Tn是如上所述的平铺长度为n的板的方式的数量。

例如T1= 10且T2= 101。

令SL为1≤abc≤L的三次和∑abc gcdTcaTcb。 例如: S2= 10444 S3= 1292115238446807016106539989 S4模数987898789 = 670616280。

找出S2000mod 987898898。

Instructions

Tests

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

Challenge Seed

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

euler440();

Solution

// solution required