2021-06-15 07:49:18 +00:00
|
|
|
---
|
|
|
|
id: 5900f3901000cf542c50fea3
|
2021-08-20 07:00:51 +00:00
|
|
|
title: 'Problema 36: Palíndromos de base dupla'
|
2021-06-15 07:49:18 +00:00
|
|
|
challengeType: 5
|
|
|
|
forumTopicId: 302020
|
|
|
|
dashedName: problem-36-double-base-palindromes
|
|
|
|
---
|
|
|
|
|
|
|
|
# --description--
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
O número decimal, 585 = 1001001<sub>2</sub> (binário), é um palíndromo em ambas as bases.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
Calcule a soma de todos os números, menores que `n`, onde 1000 ≤ `n` ≤ 1000000, que são palíndromos na base 10 e base 2.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
(Note que um número palindrômico, em qualquer base, pode não começar com números zero.)
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
# --hints--
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
`doubleBasePalindromes(1000)` deve retornar um número.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
```js
|
|
|
|
assert(typeof doubleBasePalindromes(1000) === 'number');
|
|
|
|
```
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
`doubleBasePalindromes(1000)` deve retornar 1772.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
```js
|
|
|
|
assert(doubleBasePalindromes(1000) == 1772);
|
|
|
|
```
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
`doubleBasePalindromes(50000)` deve retornar 105795.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
```js
|
|
|
|
assert(doubleBasePalindromes(50000) == 105795);
|
|
|
|
```
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
`doubleBasePalindromes(500000)` deve retornar 286602.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
```js
|
|
|
|
assert(doubleBasePalindromes(500000) == 286602);
|
|
|
|
```
|
|
|
|
|
2021-08-20 07:00:51 +00:00
|
|
|
`doubleBasePalindromes(1000000)` deve retornar 872187.
|
2021-06-15 07:49:18 +00:00
|
|
|
|
|
|
|
```js
|
|
|
|
assert(doubleBasePalindromes(1000000) == 872187);
|
|
|
|
```
|
|
|
|
|
|
|
|
# --seed--
|
|
|
|
|
|
|
|
## --seed-contents--
|
|
|
|
|
|
|
|
```js
|
|
|
|
function doubleBasePalindromes(n) {
|
|
|
|
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
|
|
|
doubleBasePalindromes(1000000);
|
|
|
|
```
|
|
|
|
|
|
|
|
# --solutions--
|
|
|
|
|
|
|
|
```js
|
|
|
|
// solution required
|
|
|
|
```
|