编程介的小学生 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 kafka 分区副本增加会导致消息丢失或者不可用吗?
  • ¥15 微信公众号自制会员卡没有收款渠道啊
  • ¥15 stable diffusion
  • ¥100 Jenkins自动化部署—悬赏100元
  • ¥15 关于#python#的问题:求帮写python代码
  • ¥20 MATLAB画图图形出现上下震荡的线条
  • ¥15 关于#windows#的问题:怎么用WIN 11系统的电脑 克隆WIN NT3.51-4.0系统的硬盘
  • ¥15 perl MISA分析p3_in脚本出错
  • ¥15 k8s部署jupyterlab,jupyterlab保存不了文件
  • ¥15 ubuntu虚拟机打包apk错误