【湖南大学2018年第十四届程序设计竞赛重现赛】A - game

最新推荐文章于 2025-03-03 12:08:49 发布

Lambo Chen

最新推荐文章于 2025-03-03 12:08:49 发布

阅读量864

点赞数 2

分类专栏： ACM 文章标签： ACM

本文链接：https://blog.youkuaiyun.com/chensanwa/article/details/80530954

版权

本文分析了湖南大学2018年第十四届程序设计竞赛中的一道题目，涉及两个玩家根据规则切割线段的游戏。游戏目标是决定谁有机会与公主共进晚餐。通过对题目的理解和示例分析，得出关键在于线段分割次数的奇偶性，并提供了AC代码解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

题目传送门 - 牛客网

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 65536K，其他语言131072K
64bit IO Format: %lld

题目描述

Tony and Macle are good friends. One day they joined a birthday party together. Fortunately, they got the opportunity to have dinner with the princess, but only one person had the chance. So they decided to play a game to decide who could have dinner with the princess.

The rules of the game are very simple. At first, there are n sticks. Each of exactly m meters in length. Each person takes turns. For one move the player chooses just one stick and cut it into several equal length sticks, and the length of each stick is an integer and no less than k. Each resulting part is also a stick which can be chosen in the future. The player who can’t make a move loses the game ,thus the other one win.