Codeforces Round #685 (Div. 2) D. Circle Game（博弈）

最新推荐文章于 2022-08-21 01:05:54 发布

Sankkl1

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量367

点赞数 2

分类专栏： codeforces 文章标签： c++ c语言博弈论

本文链接：https://blog.csdn.net/Sankkl1/article/details/110009389

版权

codeforces 专栏收录该内容

81 篇文章 1 订阅

订阅专栏

本文探讨了在一个由Ashish主导的游戏规则中，玩家如何通过最优策略在限制条件下移动令牌，以达到以(0,0)为中心、半径为d的圆形区域内的移动。分析表明，奇数步数会导致先手者(Ashish)获胜，反之则Utkarsh胜出。

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

题目链接：https://codeforc.es/contest/1451/problem/D

Utkarsh is forced to play yet another one of Ashish’s games. The game progresses turn by turn and as usual, Ashish moves first.

Consider the 2D plane. There is a token which is initially at (0,0). In one move a player must increase either the x coordinate or the y coordinate of the token by exactly k. In doing so, the player must ensure that the token stays within a (Euclidean) distance d from (0,0).

In other words, if after a move the coordinates of the token are (p,q), then p2+q2≤d2 must hold.

The game ends when a player is unable to make a move. It can be shown that the game will end in a finite number of moves. If both players play optimally, determine who will win.

Input
The first line contains a single integer t (1≤t≤100) — the number of test cases.

The only line of each test case contains two space separated integers d (1≤d≤105) and k (1≤k≤d).

Output
For each test case, if Ashish wins the game, print “Ashish”, otherwise print “Utkarsh” (without the quotes).

Example

input

output

Utkarsh
Ashish
Utkarsh
Utkarsh
Ashish

题意

A先从（0， 0）开始走，可以向上或向右走 k 个单位，谁先走出以（0， 0）为圆心，半径为 d 的圈谁就输。

分析

根据圆的方程我们可以得出每种情况下最多走几步不走出圆圈，如果是奇数，那么走完之后必定要 E 走，则 E 必输，否则 A 必输。

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int t;
ll d,k;
ll maxx;

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		maxx = 0;
		scanf("%lld%lld",&d,&k);
		for(ll i=0;i<=d;i+=k)
		{
			ll x = i;
			ll y = sqrt(d * d - x * x);
			maxx = max(maxx, x / k + y / k);
		}
		if(maxx % 2 == 0) printf("Utkarsh\n");
		else printf("Ashish\n");
	}
	return 0;
}