编程介的小学生 2019-09-14 21:36 采纳率: 20.5%
浏览 156

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

  • 写回答

0条回答 默认 最新

    报告相同问题?

    悬赏问题

    • ¥15 程序不包含适用于入口点的静态Main方法
    • ¥15 素材场景中光线烘焙后灯光失效
    • ¥15 请教一下各位,为什么我这个没有实现模拟点击
    • ¥15 执行 virtuoso 命令后,界面没有,cadence 启动不起来
    • ¥50 comfyui下连接animatediff节点生成视频质量非常差的原因
    • ¥20 有关区间dp的问题求解
    • ¥15 多电路系统共用电源的串扰问题
    • ¥15 slam rangenet++配置
    • ¥15 有没有研究水声通信方面的帮我改俩matlab代码
    • ¥15 ubuntu子系统密码忘记