freeCodeCamp/problem-443-gcd-sequence.chinese.md at b3213fc892726f234eb5e96320acb7709e24b4de

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

1019 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f5271000cf542c51003a	5	Problem 443: GCD sequence		问题443：GCD序列

Description

设g（n）为如下定义的序列：g（4）= 13，g（n）= g（n-1）+ gcd（n，g（n-1）），n> 4。

前几个值是：

 n4567891011121314151617181920... g(n)1314161718272829303132333451545560...

给出g（1 000）= 2524和g（1 000 000）= 2624152。

找到g（1015）。

Instructions

Tests

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

Challenge Seed

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

euler443();

Solution

// solution required

1019 B Raw Blame History Unescape Escape