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
Source
2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
最开始打了表。。然而并没有什么卵用,什么都没看出来。。。
然后有从新寻找出路
a,b
a+b,a-b
2*a+b,2*a-b,a+2b,a-2b…
然而就知道了。。xa+yb这个是p*gcd(a,b)呀。。那么就是看范围内有多少和p*gcd,,,,然后奇偶判断就好了。。
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
int t;
scanf("%d",&t);
for(int cas=1;cas<=t;cas++){
scanf("%d %d %d",&n,&a,&b);
int der=n/__gcd(a,b);
if(der%2==0) printf("Iaka\n");
else printf("Yuwgna\n");
}
return 0;
}
顺便附上打表代码。。。返回去看了下。。好像也符合上边的规律。。。
#include<bits/stdc++.h>
using namespace std;
int getSG(int n,bool visit[]){
bool hh[55];
memset(hh,false,sizeof(hh));
//for(int i=0;i<=4;i++) cout<<visit[i]<<endl;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(visit[i]==false||visit[j]==false) continue;
if(i+j<=n&&visit[i+j]==false){
visit[i+j]=true;
hh[getSG(n,visit)]=true;
}
if(visit[j-i]==false&&j-i>=1){
visit[j-i]=true;
hh[getSG(n,visit)]=true;
}
}
}
for(int i=0;;i++) {
if(hh[i]==false){
return i;
}
}
}
int main(){
for(int k=2;k<=17;k++)
for(int i=1;i<=k;i++){
for(int j=1;j<=k;j++){
if(i==j) continue;
bool visit[33];
memset(visit,false,sizeof(visit));
visit[i]=visit[j]=true;
cout<<k<<" "<<i<<" "<<j<<" "<<getSG(k,visit)<<endl;
}
}
return 0;
}