HDU 5512 Pagodas(gcd + 奇偶性判断)——2015ACM/ICPC亚洲区沈阳站

Pagodas

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 0    Accepted Submission(s): 0

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(包括a，b两塔)，每次只能重建编号为j+k或j-k的塔，Yuwgna和Iaka两个僧人轮流建一座塔，Yuwgna先手，最后不能建的人输，问最终获胜的人是哪个

解题思路：一开始不小心把题目看偏了，把“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.”看成了一句话，就导致题目始终看不懂。

而看懂题目之后，我们其实可以尝试一下j+k与j-k都可以得到哪些数，最终我们发现能建的塔的编号必定是gcd(a,b)的倍数(其实，由不断的j-k我们可以联想到更相减损法(gcd的一种求解方法，另一种是辗转相除法))，这样的话，我们只要判断n以内gcd(a,b)的倍数的奇偶性，就可以知道是谁获胜了。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<stdlib.h>
#include<cmath>
#include<string>
#include<algorithm>
#include<iostream>
#define exp 1e-10
using namespace std;
const int N = 25;
const int inf = 1000000005;
const int mod = 2009;
int gcd(int a,int b)  
{
    if(a%b)
        return gcd(b,a%b);
    return b;
}
int main()
{
    int t,n,a,b,k,p=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&a,&b);
        k=gcd(a,b);
        n/=k;
        n-=2;
        printf("Case #%d: ",p++);
        if(n%2)
            puts("Yuwgna");
        else
            puts("Iaka");
    }
    return 0;
}

菜鸟成长记