freeCodeCamp/problem-463-a-weird-recurrence-relation.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

Files

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.1 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f53c1000cf542c51004e	5	Problem 463: A weird recurrence relation		问题463：一种奇怪的复发关系

Description

函数$ f $定义为所有正整数，如下所示：$ f（1）= 1 $ $ f（3）= 3 $ $ f（2n）= f（n）$ $ f（4n + 1）= 2f （2n + 1） - f（n）$ $ f（4n + 3）= 3f（2n + 1） - 2f（n）$

函数$ S（n）$定义为$ \ sum_ {i = 1} ^ {n} f（i）$。 $ S（8）= 22 $和$ S（100）= 3604 $。找到$ S（3 ^ {37}）$。给出答案的最后9位数字。

Instructions

Tests

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

Challenge Seed

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

euler463();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape