2015年沈阳区域赛-重现赛hdu 5512 gcd 博弈

Pagodas

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1333    Accepted Submission(s): 935

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
  
  

题意：

古时候有n座塔，到现在只剩下序号为 a  b的塔了

两个猴子通过 j - k 和j +k的方式重修塔，每次都选择最优的

谁最后没有塔修了就输了

题解：

刚开始从样例中看出规律是min（abs（a-b），min（a，b））

样例也过了，但是就是不能AC，然后发现一组数据

16    15   9   这组数据修建的塔是

3  6  9  12  15

然后就想到了最大公约数

#include<math.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int gcd(int a,int b)
{
    while(b)
    {
        int t=a%b;
        a=b;
        b=t;
    }
    return a;
}

int main()
{
    int T;
    int cases=1;
    int n,a,b;
    //freopen("in.txt","r",stdin);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&a,&b);
        int t=n/gcd(a,b);
        if(t%2==0)
            printf("Case #%d: Iaka\n",cases++);
        else
            printf("Case #%d: Yuwgna\n",cases++);
    }
    return 0;
}