ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
67 lines
1.2 KiB
Markdown
67 lines
1.2 KiB
Markdown
---
|
|
id: 5900f3901000cf542c50fea3
|
|
title: 'Problem 36: Double-base palindromes'
|
|
challengeType: 5
|
|
forumTopicId: 302020
|
|
dashedName: problem-36-double-base-palindromes
|
|
---
|
|
|
|
# --description--
|
|
|
|
The decimal number, 585 = 1001001001<sub>2</sub> (binary), is palindromic in both bases.
|
|
|
|
Find the sum of all numbers, less than `n`, whereas 1000 ≤ `n` ≤ 1000000, which are palindromic in base 10 and base 2.
|
|
|
|
(Please note that the palindromic number, in either base, may not include leading zeros.)
|
|
|
|
# --hints--
|
|
|
|
`doubleBasePalindromes(1000)` should return a number.
|
|
|
|
```js
|
|
assert(typeof doubleBasePalindromes(1000) === 'number');
|
|
```
|
|
|
|
`doubleBasePalindromes(1000)` should return 1772.
|
|
|
|
```js
|
|
assert(doubleBasePalindromes(1000) == 1772);
|
|
```
|
|
|
|
`doubleBasePalindromes(50000)` should return 105795.
|
|
|
|
```js
|
|
assert(doubleBasePalindromes(50000) == 105795);
|
|
```
|
|
|
|
`doubleBasePalindromes(500000)` should return 286602.
|
|
|
|
```js
|
|
assert(doubleBasePalindromes(500000) == 286602);
|
|
```
|
|
|
|
`doubleBasePalindromes(1000000)` should return 872187.
|
|
|
|
```js
|
|
assert(doubleBasePalindromes(1000000) == 872187);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function doubleBasePalindromes(n) {
|
|
|
|
return n;
|
|
}
|
|
|
|
doubleBasePalindromes(1000000);
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|