Pagodas HDU - 5512 （数论）

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

讲道理他给这么多样例，就是以找规律为导向的。但是这种规律能找出来我服！我当然还是推导了，用一点数论的知识就可以证明。
思路：
假设没有范围限制，只是给两个点，那么接来下能够扩展的点有什么什么特点？
设：初始点$a和b$，那么下一个点的产生是$a+b$或$a-b$,那么下一个呢？可能是$2a+b$或$2a+b$等等，其实很显然了，
所能生产点的特点就是

$$xa+yb$$
假设 $num=xa+yb$,那么num有什么要去呢，这个是有定理的，只有 $gcd(a,b)能整除num$,（不知道的赶快补）那么这个num才能被表示。
那么有多少个只有的num?
$$total=\frac{n}{gcd(a,b)}(向下取整)$$
如果数量是偶数，先手输反之先手赢…
签到题难度。

#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
#define maxx 20050
using namespace std;
int t;
int n,a,b;
int gcd(int x,int y)
{
    while(y^=x^=y^=x%=y);
    return x;
}
int k;
int main()
{
    cin>>t;
    int cal=1;
    while(t--)
    {
        scanf("%d%d%d",&n,&a,&b);
        k=gcd(a,b);
        int left=n/k;
        printf("Case #%d: ",cal++);
        if(left&1)
            cout<<"Yuwgna"<<endl;
        else
            cout<<"Iaka"<<endl;
    }
    return 0;
}