Watermelon Game

Interview

Time limit1sMemory limit1024 MB

Summary

Given N and K cherries, find how many level N watermelons can be made by merging two equal-level fruits into the next level.

Problem

A level 1 fruit is a cherry, and a level $N$ fruit is a watermelon.

You can consume two level $i$ fruits to make one level $i+1$ fruit. $(1 \leq i \leq N-1)$

Find the maximum number of watermelons you can make from $K$ cherries.

The first line contains two integers $N$ and $K$ , separated by a space. $(2 \leq N \leq 30; 1 \leq K \leq 10^9)$

Print the maximum number of watermelons that can be made on the first line.