63 lines
1.1 KiB
Markdown
63 lines
1.1 KiB
Markdown
|
---
|
||
|
|
id: 5
|
||
|
|
localeTitle: 5900f4151000cf542c50ff28
|
||
|
|
challengeType: 5
|
||
|
|
title: 'Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2'
|
||
|
|
---
|
||
|
|
|
||
|
|
## Description
|
||
|
|
<section id='description'>
|
||
|
|
Defina f (0) = 1 y f (n) para que sea el número de formas diferentes en que n puede expresarse como una suma de potencias enteras de 2 utilizando cada potencia no más de dos veces.
|
||
|
|
Por ejemplo, f (10) = 5 ya que hay cinco formas diferentes de expresar 10:
|
||
|
|
1 + 1 + 8
|
||
|
|
1 + 1 + 4 + 41 + 1 + 2 + 2 + 4
|
||
|
|
2 + 4 + 4
|
||
|
|
2 + 8
|
||
|
|
¿Qué es f (1025)?
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Instructions
|
||
|
|
<section id='instructions'>
|
||
|
|
|
||
|
|
</section>
|
||
|
|
|
||
|
|
## Tests
|
||
|
|
<section id='tests'>
|
||
|
|
|
||
|
|
```yml
|
||
|
|
tests:
|
||
|
|
- text: <code>euler169()</code> debe devolver 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>
|