freeCodeCamp/problem-341-golombs-self-describing-sequence.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
5900f4c11000cf542c50ffd3	5	Problem 341: Golomb"s self-describing sequence		问题341：Golomb的自我描述序列

Description

Golomb的自描述序列{G（n）}是唯一的非递减自然数序列，因此n在序列中恰好出现G（n）次。前几个n的G（n）值是

n123456789101112131415 ... G（n）的122334445556666 ...

给出G（103）= 86，G（106）= 6137.对于1≤n<103，还给出ΣG（n3）= 153506976。

找到ΣG（n3）为1≤n<106。

Instructions

Tests

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

Challenge Seed

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

euler341();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape