from math import log2, ceil
n, k = map(int, input().split())
prob = [0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1)]
print(sum(prob) / n) from math import log2, ceil n, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k 0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1) for i in range(1, n + 1) i range(1, n + 1) range 1 n + 1 n 1 for i in range(1, n + 1) 0.5**max(ceil(log2(k / i)), 0) 0.5 max(ceil(log2(k / i)), 0) max ceil(log2(k / i)) ceil log2(k / i) log2 k / i k i 0 prob = [0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1)] prob [0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1)] print(sum(prob) / n) print sum(prob) / n sum(prob) sum prob n prob = [0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1)] [0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1)] prob k = map(int, input().split()) map(int, input().split()) k n, k = map(int, input().split()) map(int, input().split()) n
from math import log2, ceil
n, k = map(int, input().split())
prob = [0.5**max(ceil(log2(k / i)), 0) for i in range(1, n + 1)]
print(sum(prob) / n)