Pagodas 等差数列
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)i (i∉{a,b} and 1≤i≤n) if there exist two pagodas standing erect, labelled jj and kkrespectively, such that i=j+ki=j+k or i=j−ki=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.
InputThe first line contains an integer t (1≤t≤500)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)n (2≤n≤20000) and two different integers aa and bb.OutputFor 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个数字相加或者相减得出的数列是gcd(a,b)的等差数列,求出有几项就OK了
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<sstream>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
#include<fstream>
#include<set>
#include<memory>
#include<bitset>
#include<string>
#include<functional>
using namespace std;
typedef long long LL; int T, a, b, n;
int gcd(int a, int b)
{
if (b == )
return a;
else
return gcd(b, a%b);
}
int main()
{
scanf("%d", &T);
for(int cas = ;cas<=T;cas++)
{
scanf("%d%d%d", &n,&a ,&b);
if (!((n / gcd(a, b)) & ))
printf("Case #%d: Iaka\n", cas);
else
printf("Case #%d: Yuwgna\n", cas);
}
}
最新文章
- JVM加载类的过程,双亲委派机制中的方法
- 035医疗项目-模块三:药品供应商目录模块——供货商药品目录(批量)添加药品的功能---------Service
- CompositeConfiguration的用法
- Eclipse中将项目导出jar包,以及转化成exe的方法
- 为什么浏览器User-agent总是有Mozilla字样(User-agent String里的历史故事)【搜藏】
- Git 的优点
- Oracle 体系结构及安全管理
- C#的Split用法
- 我的MYSQL学习心得(四)
- python(学习之路一)
- 2、各种折腾,安装交叉环境的gcc和qt,测试c++和qt程序
- 计蒜客NOIP模拟赛(2)D1T3 深黑幻想
- 在Coding上搭建Hexo个人博客
- Kubernetes之调度器和调度过程
- [ZJOI2019]麻将
- java.io.IOException: No space left on device 错误
- 使用Swoole 构建API接口服务
- win10 + Ubuntu 双系统,重装后的引导修复,时间调整和启动项调整
- zg项目 应用系统编码原则
- Spring工作原理与单例