poj1082——Calendar Game(博弈论,奇偶判定)
来源:互联网 发布:软件体系结构评估文档 编辑:程序博客网 时间:2024/05/16 12:19
Description
Adam and Eve enter this year’s ACM International Collegiate Programming Contest. Last night, they played the Calendar Game, in celebration of this contest. This game consists of the dates from January 1, 1900 to November 4, 2001, the contest day. The game starts by randomly choosing a date from this interval. Then, the players, Adam and Eve, make moves in their turn with Adam moving first: Adam, Eve, Adam, Eve, etc. There is only one rule for moves and it is simple: from a current date, a player in his/her turn can move either to the next calendar date or the same day of the next month. When the next month does not have the same day, the player moves only to the next calendar date. For example, from December 19, 1924, you can move either to December 20, 1924, the next calendar date, or January 19, 1925, the same day of the next month. From January 31 2001, however, you can move only to February 1, 2001, because February 31, 2001 is invalid.
A player wins the game when he/she exactly reaches the date of November 4, 2001. If a player moves to a date after November 4, 2001, he/she looses the game.
Write a program that decides whether, given an initial date, Adam, the first mover, has a winning strategy.
For this game, you need to identify leap years, where February has 29 days. In the Gregorian calendar, leap years occur in years exactly divisible by four. So, 1993, 1994, and 1995 are not leap years, while 1992 and 1996 are leap years. Additionally, the years ending with 00 are leap years only if they are divisible by 400. So, 1700, 1800, 1900, 2100, and 2200 are not leap years, while 1600, 2000, and 2400 are leap years.
Input
The input consists of T test cases. The number of test cases (T ) is given in the first line of the input file. Each test case is written in a line and corresponds to an initial date. The three integers in a line, YYYY MM DD, represent the date of the DD-th day of MM-th month in the year of YYYY. Remember that initial dates are randomly chosen from the interval between January 1, 1900 and November 4, 2001.
Output
Print exactly one line for each test case. The line should contain the answer “YES” or “NO” to the question of whether Adam has a winning strategy against Eve. Since we have T test cases, your program should output totally T lines of “YES” or “NO”.
Sample Input
3
2001 11 3
2001 11 2
2001 10 3
Sample Output
YES
NO
NO
两个人博弈的方式只能是day+1或者month+1,所以day+month的和总是处在奇数与偶数的变换中。最终时间是11+4为奇数,所以第一个人开始时和为偶数就能赢。还有两个特殊情况是9+30和11+30,这两天的后一天还是奇数,还是能把奇数情况留给另一个人,所以要特判。
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#define MAXN 5005using namespace std;int main(){ int t,y,m,d; scanf("%d",&t); while(t--) { scanf("%d%d%d",&y,&m,&d); if((m+d)%2==0||(d==30&&(m==9||m==11))) printf("YES\n"); else printf("NO\n"); } return 0;}
- poj1082——Calendar Game(博弈论,奇偶判定)
- Calendar Game POJ1082
- POJ1082:Calendar Game
- POJ1082 Calendar Game(博弈)
- [POJ1082]Calendar Game & HDU1079 Calendar Game
- HDU1079 POJ1082 Calendar Game【博弈】
- poj 1079 Calendar Game(博弈论 SG)
- HDU 1079 Calendar Game (博弈论-sg)
- HDU-1079 Calendar Game(博弈论)
- HDOJ1079&POJ1082&ZOJ1024 Calendar Game [找规律博弈]
- hdu 1079 Calendar Game 博弈论
- HDOJ 1079 Calendar Game 博弈论
- Calendar Game - POJ 1082 博弈论
- HDU-1079-Calendar Game 【奇偶】
- hdu Calendar Game (博弈论奇偶性找规律)
- HDU 1079 Calendar Game (奇偶规律,SG函数)*
- hdu1564—Play a game(博弈论)
- 博弈论——game thoery
- [LeetCode]-292. Nim Game(Easy)(C + 尼姆游戏)
- 初探Linux
- fir.im weekly - 「 持续集成 」实践教程合集
- 架构、框架、设计模式之间的关系简述
- 发布测试版本,通过网页在线安装ipa和apk
- poj1082——Calendar Game(博弈论,奇偶判定)
- Java多线程编程6--单例模式与多线程--使用静态内置类、(反)序列化、static代码块、enum枚举数据类实现
- 文章标题
- opacity+visibility+transition组合代替jquery 的fadeIn ,fadeOut
- 用android原生代码实现联网得到图片
- 多线程的初步理解
- 使用类的属性 get_set.php
- 解决Android模拟器中修改host文件无效/android域名解析为Ip方法
- failed to open file mysql,导入mysql数据库打不开的解决办法