Advertisement
gruslan

Adel

Jun 15th, 2023
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.43 KB | None | 0 0
  1. def f(n):
  2.     bin_n = str(bin(n))[2:]
  3.     bin_n += '0' if bin_n.count('1') > bin_n.count('0') else '1'
  4.  
  5.     len_bin_n = len(bin_n)
  6.     if len(bin_n) % 2 == 0:
  7.         bin_n = bin_n[:len_bin_n // 2 - 1] + bin_n[len_bin_n // 2 + 1:]
  8.     else:
  9.         bin_n = bin_n[:len_bin_n // 2 - 1] + bin_n[len_bin_n // 2 + 2:]
  10.  
  11.     return int(bin_n, 2) if bin_n else 0
  12.  
  13.  
  14. print(sum(f(n) == 58 for n in range(1, 1000000)))
  15.    
  16.        
  17.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement