2018南京ICPC-A

最新推荐文章于 2020-10-23 21:20:20 发布

如梦如花

最新推荐文章于 2020-10-23 21:20:20 发布

阅读量129

点赞数

本文链接：https://blog.csdn.net/MarilynYangYang/article/details/109229267

版权

本文探讨了Adrien和Austin在一个游戏中如何通过策略选择连续岩石来决定胜负。给定初始岩石数量和每次移除限制，分析最优策略以预测游戏赢家。关键在于理解玩家如何利用规则，特别是当N、K不同时的策略对比。

摘要由CSDN通过智能技术生成

题目：Adrien and Austin

Adrien and Austin are playing a game with rocks. Initially, there are N rocks, indexed from 1 to N. In one move, the player chooses at least 1 and at most K consecutively indexed rocks (all of them should not have been removed) and removes them from the game. Adrien always starts the game, and then Adrien and Austin take turns making moves. The player who is unable to make a move (because all rocks are removed) loses. Given N, K, find who is going to win the game (assuming they are smart and are playing optimally).

Input:

The first line contains two integers N, K (0 ≤ N ≤ 106 , 1 ≤ K ≤ 106 ).

Output:

Print a name (“Adrien” or “Austin”, without the quotes) — the person who is going to win the game.*

Examples

在这里插入图片描述

代码

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b;
	cin>>a>>b;
if(a==0)
cout<<"Austin"<<endl;
else if(a<=b)
cout<<"Adrien"<<endl;
else if(b==1){
	if(a%2==0)
	cout<<"Austin"<<endl;
	else
	cout<<"Adrien"<<endl;
}
else{

		cout<<"Adrien"<<endl;
	}	
}