freeCodeCamp/problem-305-reflexive-position.chinese.md at d7cd3f7777778067a931ac2dad7aedb5aa406b3e

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
5900f49d1000cf542c50ffb0	5	Problem 305: Reflexive Position		问题305：反身姿势

Description

我们称S为（无限）字符串，该字符串是通过连接以10为底的连续正整数（从1开始）而形成的。因此，S = 1234567891011121314151617181920212223242 ...

很容易看出，任何数字在S中都会显示无数次。

让我们将f（n）称为S中第n次出现n的起始位置。例如，f（1）= 1，f（5）= 81，f（12）= 271和f（7780）= 111111365。

求出∑f（3k）为1≤k≤13。

Instructions

Tests

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

Challenge Seed

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

euler305();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape