+/foobar
google programming puzzles
git clone https://git.julia.blue/+/foobar
2e1d345
master
1def brute (n ): 2n = int (n ) 3if n <= 1 : 4return 0 5if n % 2 == 0 : 6return 1 + brute (n / 2 ) 7return min (brute (n + 1 ),brute (n - 1 ))+ 1 8 9def trailingZeros (n ): 10return len (bin (n ).split ('1' )[- 1 ]) 11 12def answer (n ): 13n = int (n ) 14count = 0 15while n > 3 : 16if n % 2 == 0 : 17n /= 2 18else : 19n += 1 if bin (n + 1 ).count ('0' )>= bin (n - 1 ).count ('0' )else - 1 20count += 1 21return count + n - 1 22 23def answer2 (n ): 24n = int (n ) 25count = 0 26while n > 3 : 27if n % 2 == 0 : 28n /= 2 29else : 30n += 1 if trailingZeros (n + 1 )> trailingZeros (n - 1 )else - 1 31count += 1 32return count + n - 1 33 34def answer3 (num ): 35num = int (num ) 36num = [int (i )for i in "{0:b}" .format (num )] 37 38count = len (num )- 1 39 40while len (num )> 1 : 41a = (num [- 2 ],num .pop ()) 42 43if a == (1 ,1 )and len (num )> 1 : 44 45while num [- 1 ]is not 0 and len (num )> 1 : 46num .pop () 47 48count += 1 49num [- 1 ]= 1 50 51if len (num )is 1 : 52count += 1 53 54elif a == (1 ,1 ): 55count += 1 56 57elif a == (0 ,1 ): 58count += 1 59 60return count 61 62def answer4 (n ): 63n = int (n ) 64count = 0 65while n > 3 : 66if n % 2 == 0 : 67n /= 2 68else : 69n += 1 if n % 4 == 3 else - 1 70count += 1 71return count + n - 1 72 73# print trailingZeros(58) 74# import sys 75# sys.exit() 76 77' ' .join ('{:2}' .format (i )for i in range (30 )) 78' ' .join ('{:2}' .format (answer4 (str (n )))for n in range (30 )) 79' ' .join ('{:2}' .format (answer (str (n )))for n in range (30 )) 80 81for i in range (5 ,10000 ): 82i 83if answer2 (i )!= answer (i ): 84answer4 (i ),answer (i ) 85break 86 87answer (10 ** 300 )