编程介的小学生 2017-10-17 09:23 采纳率: 20.5%
浏览 1551
已采纳

ATP

Description

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 = 2x, x∈N, n <= 5000). Find the player with the worst classification who could theoretically win the tournament.
Input

The input contains n and k separated by one space.
Output

The output contains a single integer, the position in the ATP classification who will win the tournament.
Sample Input

16 3
Sample Output

11

  • 写回答

1条回答 默认 最新

  • threenewbee 2017-11-01 15:48
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 孟德尔随机化结果不一致
  • ¥15 apm2.8飞控罗盘bad health,加速度计校准失败
  • ¥15 求解O-S方程的特征值问题给出边界层布拉休斯平行流的中性曲线
  • ¥15 谁有desed数据集呀
  • ¥20 手写数字识别运行c仿真时,程序报错错误代码sim211-100
  • ¥15 关于#hadoop#的问题
  • ¥15 (标签-Python|关键词-socket)
  • ¥15 keil里为什么main.c定义的函数在it.c调用不了
  • ¥50 切换TabTip键盘的输入法
  • ¥15 可否在不同线程中调用封装数据库操作的类