Pagodas
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.
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.
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
题意:1到n个塔,Yuwgna和Iaka两人从a,b两点开始修建塔,每次可以修建塔的位置i=j+k或i=j-k;j和k为已修建好的塔的位置,Yuwgna开始修,最后谁不能修了谁就输了,问最后谁赢。
可以修建塔的位置的个数就只有n/gcd(a, b);然后最后判断总共可以修建的塔的个数是奇数还是偶数就ok了。
#include<cstdio>
int GCD(int x,int y)
{
int pl;
while(x%y)
{
pl=x;
x=y;
y=pl%y;
}
return y;
}
int main()
{
int T,N,a,b,kl,nl=0;
scanf("%d",&T);
while(T--)
{
scanf("%d%d%d",&N,&a,&b);
kl=N/GCD(a,b);
if(kl&1)
printf("Case #%d: Yuwgna\n",++nl);
else
printf("Case #%d: Iaka\n",++nl);
}
return 0;
}