阿德里安和奥斯汀 - 题目

#8971. 阿德里安和奥斯汀

统计

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

Adrien 和 Austin 正在玩一个关于石头的游戏。

最初有 $N$ 块石头，编号从 $1$ 到 $N$。在每一轮中，玩家可以选择至少 $1$ 块且至多 $K$ 块连续编号的石头（这些石头必须尚未被移除），并将它们从游戏中移除。

Adrien 总是先手，随后 Adrien 和 Austin 交替进行操作。无法进行操作的玩家（因为所有石头都已被移除）输掉游戏。

给定 $N$ 和 $K$，请找出谁将赢得这场游戏（假设双方都足够聪明且采取最优策略）。

输入格式

第一行包含两个整数 $N, K$ ($0 \le N \le 10^6, 1 \le K \le 10^6$)。

输出格式

输出一个名字（"Adrien" 或 "Austin"，不含引号），即获胜者的名字。

样例

输入 1

1 1

输出 1

Adrien

输入 2

9 3

输出 2

Adrien

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0