Projectetables ----> problem = 36 ---- double-base palindromes

Problem 36

The decimal number, 585 = 10010010012 (Binary), is palindromic in both bases.

Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.

(Please note that the palindromic number, in either base, may not include leading zeros .)

Def iscycle (n): If n % 10 = 0: Return false tempn = n num = List () while n> 0: num. insert (0, N % 2) N/= 2 for I in range (0, INT (LEN (Num)/2): If num [I]! = Num [Len (Num)-i-1]: Return false value = List () while tempn> 0: value. insert (0, tempn % 10) tempn/= 10 for I in range (0, INT (LEN (value)/2): If value [I]! = Value [Len (value)-1-I]: Return false return truedef main (): resu = 0 for I in range (1,000000): If iscycle (I ): resu + = I print resuif _ name _ = "_ main _": Main ()
 

 
Class string def iscycle? Self = self. Reverse endendputs (1 .. 1000000). Select {| I. to_s.iscycle? & I. to_s (2). iscycle? }. Reduce (: +)
 

Projectetables ----> problem = 36 ---- double-base palindromes