62 lines
1.8 KiB
Markdown
62 lines
1.8 KiB
Markdown
---
|
|
id: 5900f3901000cf542c50fea3
|
|
challengeType: 5
|
|
title: 'Problem 36: Double-base palindromes'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 36: palíndromos de doble base'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> El número decimal, 585 = 10010010012 (binario), es palindrómico en ambas bases. Encuentre la suma de todos los números, menos que n, mientras que 1000 <= n <= 1000000, que son palíndromos en la base 10 y en la base 2. (Tenga en cuenta que el número palindrómico, en cualquiera de las bases, puede no incluir ceros a la izquierda). </section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>doubleBasePalindromes(1000)</code> debe devolver 1772.
|
|
testString: 'assert(doubleBasePalindromes(1000) == 1772, "<code>doubleBasePalindromes(1000)</code> should return 1772.");'
|
|
- text: <code>doubleBasePalindromes(50000)</code> debe devolver 105795.
|
|
testString: 'assert(doubleBasePalindromes(50000) == 105795, "<code>doubleBasePalindromes(50000)</code> should return 105795.");'
|
|
- text: <code>doubleBasePalindromes(500000)</code> debe devolver 286602.
|
|
testString: 'assert(doubleBasePalindromes(500000) == 286602, "<code>doubleBasePalindromes(500000)</code> should return 286602.");'
|
|
- text: <code>doubleBasePalindromes(1000000)</code> debe devolver 872187.
|
|
testString: 'assert(doubleBasePalindromes(1000000) == 872187, "<code>doubleBasePalindromes(1000000)</code> should return 872187.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function doubleBasePalindromes(n) {
|
|
// Good luck!
|
|
return n;
|
|
}
|
|
|
|
doubleBasePalindromes(1000000);
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|