2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)HDU5512 Pagodas
来源:互联网 发布:php空间 编辑:程序博客网 时间:2024/06/09 21:07
Pagodas
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 161 Accepted Submission(s): 134
Problem Description
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
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 integern (2≤n≤20000) and two different integers a and b .
For each test case, the first line provides the positive integer
Output
For each test case, output the winner (``Yuwgna" or ``Iaka"). Both of them will make the best possible decision each time.
Sample Input
162 1 23 1 367 1 2100 1 28 6 89 6 810 6 811 6 812 6 813 6 814 6 815 6 816 6 81314 6 81994 1 131994 7 12
Sample Output
Case #1: IakaCase #2: YuwgnaCase #3: YuwgnaCase #4: IakaCase #5: IakaCase #6: IakaCase #7: YuwgnaCase #8: YuwgnaCase #9: IakaCase #10: IakaCase #11: YuwgnaCase #12: YuwgnaCase #13: IakaCase #14: YuwgnaCase #15: IakaCase #16: Iaka
Source
2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
0 0
- hdu5512 Pagodas(2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) )
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)HDU5512 Pagodas
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) HDU 5512 Pagodas
- HDU 5512 Pagodas 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
- Pagodas --(hdu5512)2015ACM/ICPC亚洲区沈阳站
- HDU 5950 Recursive sequence(2016ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学))
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) Meeting(SPAF+拆点)
- 2016ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) 1003Recursive sequence(题解)
- HDU 5512 Pagodas (GCD博弈 + 2015ACM/ICPC亚洲区沈阳站-重现赛)
- HDU 5514 Frogs(容斥原理)——2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
- HDU-5512 Pagodas(GCD)(2015ACM/ICPC亚洲区沈阳站-重现赛)
- 【hdu 5521】【 2015ACM/ICPC亚洲区沈阳站重现赛】Meeting 题意&题解&代码
- hdu 5510 Bazinga 2015ACM/ICPC亚洲区沈阳站-重现赛
- hdu 5521 Meeting 2015ACM/ICPC亚洲区沈阳站-重现赛
- 2015ACM/ICPC亚洲区沈阳站-重现赛 HUD 5514 Frogs (容斥原理+GCD)
- HDU 5512 Pagodas(gcd + 奇偶性判断)——2015ACM/ICPC亚洲区沈阳站
- HDU 5512 Pagodas 找规律 (2015ACM/ICPC亚洲区沈阳站)
- [HDU 5512][2015ACM/ICPC亚洲区沈阳站] Pagodas 博弈论
- 聊聊并发(十)生产者消费者模式
- SqlMapClientTemplate用法
- 图像处理中的数学原理详解(Part8) ——傅立叶变换的来龙去脉
- git stash使用 笔记
- MSM--Memcached_Session_Manager介绍及使用
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)HDU5512 Pagodas
- 表达式文法以及parse实现
- 纯CSS制作的渐变层(兼容IE/Firefox/Opera)
- service httpd does not support chkconfig linux
- 聚集、非聚集索引、唯一索引、复合索引、系统自建索引
- mysql度字段模糊查询
- 移动web资源整理
- PHP接收APP端传输的图片/视频等文件需配置服务器
- [LeetCode]Longest Increasing Subsequence