Pagodas
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1306 Accepted Submission(s): 922
Problem Description
n
pagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from
1
to
n
. However, only two of them (labelled
a
and
b
, where
1≤a≠b≤n
) withstood the test of time.
Two monks, Yuwgna and Iaka, decide to make glories great again. They take turns to build pagodas and Yuwgna takes first. For each turn, one can rebuild a new pagodas labelled i (i∉{a,b} and 1≤i≤n) if there exist two pagodas standing erect, labelled j and k respectively, such that i=j+k or i=j−k . Each pagoda can not be rebuilt twice.
This is a game for them. The monk who can not rebuild a new pagoda will lose the game.
Two monks, Yuwgna and Iaka, decide to make glories great again. They take turns to build pagodas and Yuwgna takes first. For each turn, one can rebuild a new pagodas labelled i (i∉{a,b} and 1≤i≤n) if there exist two pagodas standing erect, labelled j and k respectively, such that i=j+k or i=j−k . Each pagoda can not be rebuilt twice.
This is a game for them. The monk who can not rebuild a new pagoda will lose the game.
Input
The first line contains an integer
t (1≤t≤500)
which is the number of test cases.
For each test case, the first line provides the positive integer n (2≤n≤20000) and two different integers a and b .
For each test case, the first line provides the positive integer n (2≤n≤20000) and two different integers a and b .
Output
For each test case, output the winner (``Yuwgna" or ``Iaka"). Both of them will make the best possible decision each time.
Sample Input
16 2 1 2 3 1 3 67 1 2 100 1 2 8 6 8 9 6 8 10 6 8 11 6 8 12 6 8 13 6 8 14 6 8 15 6 8 16 6 8 1314 6 8 1994 1 13 1994 7 12
Sample Output
Case #1: Iaka Case #2: Yuwgna Case #3: Yuwgna Case #4: Iaka Case #5: Iaka Case #6: Iaka Case #7: Yuwgna Case #8: Yuwgna Case #9: Iaka Case #10: Iaka Case #11: Yuwgna Case #12: Yuwgna Case #13: Iaka Case #14: Yuwgna Case #15: Iaka Case #16: Iaka
Source
HDU 5512
题意:n个塔,除了a和b都坏了,Two monks, Yuwgna and Iaka,想要重建,Yuwgna先来,
谁不能重建了,谁就输了,重建i的方法前提是有两个塔p+q = i。
思路:找规律,重建的塔只能是gcd的倍数。
也可以从a,b向上向下迭代找个数。做法基本都是规律,,
/*
HDU 5512
题意:n个塔,除了a和b都坏了,Two monks, Yuwgna and Iaka,想要重建,Yuwgna先来,
谁不能重建了,谁就输了,重建i的方法前提是有两个塔p+q = i。
思路:重建的塔只能是
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int gcd(int a,int b){return b == 0 ? a : gcd(b,a%b);}
int main()
{
int t,n,a,b;
cin >> t;
for(int ca = 1;ca <= t;ca++)
{
scanf("%d%d%d",&n,&a,&b);
printf("Case #%d: ",ca);
int d = gcd(a,b);
int cnt = 0,k = d;
while(k <= n)
{
cnt++;
k += d;
}
cnt -= 2;
if(cnt % 2 == 0)
printf("Iaka\n");
else
printf("Yuwgna\n");
}
return 0;
}