题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=5512
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
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.
1 #include<cstdio> 2 int gcd(int m,int n){return n?gcd(n,m%n):m;} 3 int n,a,b; 4 int main() 5 { 6 int t; 7 scanf("%d",&t); 8 for(int kase=1;kase<=t;kase++) 9 { 10 scanf("%d%d%d",&n,&a,&b); 11 int cnt=0,d=gcd(a,b); 12 for(int i=gcd(a,b);i<=n;i+=d) cnt++; 13 printf("Case #%d: %s ",kase,(cnt%2)?"Yuwgna":"Iaka"); 14 } 15 }