POJ 1082 Calendar Game turn almanac: Adam and Eve to play the game, between January 4, 1990, No. 1 in November 2001 out of a random date, the two take turns to increase date, Adam upper hand. To date this provision can only move one day or the next month it move across one day (if not next month, this day, you can not move). November 4 who should eventually move in 2001, whoever wins. Now given date, to determine whether Adam have a winning strategy. 4.1 to find a winning strategy game of reasoning and dynamic programming algorithm if drawn on the last day certainly doomed to failure, it would be doomed to failure by the state Wang Qianmian recursion. State has arranged by date, each C ...
Continue reading : yard farm >> POJ 1082 Calendar Game problem solution "Challenge Programming Contest"
Original link : http://www.hankcs.com/program/algorithm/poj-1082-calendar-game.html
Reproduced in: https: //my.oschina.net/hankcs/blog/510404