Files

Oliver Eyton-Williams 0bd52f8bd1 Feat: add new Markdown parser (#39800 )

and change all the challenges to new `md` format.

2020-11-27 10:02:05 -08:00

id, title, challengeType, forumTopicId

id	title	challengeType	forumTopicId
5900f49d1000cf542c50ffb0	Problem 305: Reflexive Position	5	301959

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

--hints--

euler305() should return 18174995535140.

assert.strictEqual(euler305(), 18174995535140);

function euler305() {

  return true;
}

euler305();

// solution required