56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4151000cf542c50ff28
|
||
challengeType: 5
|
||
title: 'Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2'
|
||
videoUrl: ''
|
||
localeTitle: 问题169：探索数字可以表示为2的幂之和的不同方式的数量
|
||
---
|
||
|
||
## Description
|
||
<section id="description">将f（0）= 1和f（n）定义为不同方式的数量n可以表示为2的整数幂之和，使用每个幂不超过两次。例如，f（10）= 5因为有五种不同的表达方式10：1 + 1 + 8 1 + 1 + 4 + 41 + 1 + 2 + 2 + 4 2 + 4 + 4 2 + 8什么是f （1025）？ </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler169()</code>应该返回178653872807。
|
||
testString: 'assert.strictEqual(euler169(), 178653872807, "<code>euler169()</code> should return 178653872807.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler169() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler169();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|