Problem 36 » 履歴 » バージョン 1
Noppi, 2024/01/14 11:45
| 1 | 1 | Noppi | [ホーム](https://redmine.noppi.jp) - [[Wiki|Project Euler]] |
|---|---|---|---|
| 2 | # [[Problem 36]] |
||
| 3 | |||
| 4 | ## Double-base Palindromes |
||
| 5 | The decimal number, $585 = 1001001001_2$ (binary), is palindromic in both bases. |
||
| 6 | |||
| 7 | Find the sum of all numbers, less than one million, which are palindromic in base $10$ and base $2$. |
||
| 8 | |||
| 9 | (Please note that the palindromic number, in either base, may not include leading zeros.) |
||
| 10 | |||
| 11 | ## 二種類の基数による回文数 |
||
| 12 | $585 = 1001001001_2$ (2進) は10進でも2進でも回文数である. |
||
| 13 | |||
| 14 | 100万未満で10進でも2進でも回文数になるような数の総和を求めよ. |
||
| 15 | |||
| 16 | (注: 先頭に0を含めて回文にすることは許されない.) |
||
| 17 | |||
| 18 | ```scheme |
||
| 19 | ``` |