56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
---
|
||
id: 5900f4d51000cf542c50ffe8
|
||
challengeType: 5
|
||
title: 'Problem 361: Subsequence of Thue-Morse sequence'
|
||
videoUrl: ''
|
||
localeTitle: 问题361:Thue-Morse序列的子序列
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> Thue-Morse序列{Tn}是满足以下条件的二进制序列:T0 = 0T2n = Tn T2n + 1 = 1-Tn <p> {Tn}的前几个术语如下:01101001100101101001011001101001 .... </p><p>我们将{An}定义为整数的排序序列,使得每个元素的二进制表达式在{Tn}中显示为子序列。例如,十进制数18以二进制表示为10010。 10010出现在{Tn}(T8到T12)中,因此18是{An}的元素。十进制数14以二进制表示为1110。 1110永远不会出现在{Tn}中,因此14不是{An}的元素。 </p><p> An的前几个术语如下:n0123456789101112 ... An012345691011121318 ... </p><p>我们还可以验证A100 = 3251和A1000 = 80852364498。 </p><p>找到最后9位数。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler361()</code>应该返回178476944。
|
||
testString: 'assert.strictEqual(euler361(), 178476944, "<code>euler361()</code> should return 178476944.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler361() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler361();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|