greatbody
/
freeCodeCamp
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-361-subsequence-of-...

55 lines
1.2 KiB
Markdown
Raw Normal View History

feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
---
id: 5900f4d51000cf542c50ffe8
title: 'Problem 361: Subsequence of Thue-Morse sequence'
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
challengeType: 5
fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558)
2019-08-05 16:17:33 +00:00
forumTopicId: 302022
feat(curriculum): restore seed + solution to Chinese (#40683) * feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-13 02:31:00 +00:00
dashedName: problem-361-subsequence-of-thue-morse-sequence
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
---
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
# --description--
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
The Thue-Morse sequence {Tn} is a binary sequence satisfying:
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
T0 = 0
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
T2n = Tn
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
T2n+1 = 1 - Tn
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
The first several terms of {Tn} are given as follows: 01101001100101101001011001101001....
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
We define {An} as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in {Tn}. For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in {Tn} (T8 to T12), so 18 is an element of {An}. The decimal number 14 is expressed as 1110 in binary. 1110 never appears in {Tn}, so 14 is not an element of {An}.
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
The first several terms of An are given as follows: n0123456789101112…An012345691011121318…
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
We can also verify that A100 = 3251 and A1000 = 80852364498.
Find the last 9 digits of .
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
# --hints--
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
`euler361()` should return 178476944.
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler361(), 178476944);
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
```
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
# --seed--
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
## --seed-contents--
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
```js
function euler361() {
fix: remove Good luck! comment from challenge seed code (#39575)
2020-09-15 16:57:40 +00:00
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
return true;
}
euler361();
```
Feat: add new Markdown parser (#39800) and change all the challenges to new `md` format.
2020-11-27 18:02:05 +00:00
# --solutions--
feat(challenge-md): Add initial markdown challenge files
2018-09-30 22:01:58 +00:00
```js
// solution required
```