## B:ATP

- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB

- 描述
- All the tennis players are ordered by their results in an ATP (Association of Tennis Professionals) classification. The past year's statistics say that in a game, if the difference between the two opponents is more than k places in the ATP top, then the player with the better classification will win for sure; but if the difference between the players is of k places or less, then the winner is uncertain.

In a tournament that will take place in an eliminatory system, n professional players announced their participation (n = 2^{x}, x∈N, n <= 5000). Find the player with the worst classification who could theoretically win the tournament.

- 输入
- The input contains n and k separated by one space.
- 输出
- The output contains a single integer, the position in the ATP classification who will win the tournament.
- 样例输入
16 3

- 样例输出
11

- 来源
- Romania OI 2002

- 全局题号
- 820
- 添加于
- 2018-01-02
- 提交次数
- 9
- 尝试人数
- 6
- 通过人数
- 6