freeCodeCamp/problem-305-reflexive-position.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f49d1000cf542c50ffb0	5	Problem 305: Reflexive Position

Description

Let's call S the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1) written down in base 10. Thus, S = 1234567891011121314151617181920212223242...

It's easy to see that any number will show up an infinite number of times in S.

Let's call f(n) the starting position of the nth occurrence of n in S. For example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.

Find ∑f(3k) for 1≤k≤13.

Instructions

Tests

tests:
  - text: <code>euler305()</code> should return 18174995535140.
    testString: assert.strictEqual(euler305(), 18174995535140, '<code>euler305()</code> should return 18174995535140.');

Challenge Seed

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

euler305();

Solution

// solution required

1.1 KiB Raw Blame History