A Simple GameTime
limit:1000/1000 MS (java/others) Memory limit:32768/65535 K (java/others)
Total submission (s): 1194 Accepted Submission (s): 750
Problem Descriptionagrael likes play a simple game with his friend Animal during the classes. In this Game there is n piles of stones numbered from 1 to N, the 1st pile have M1 stones, the 2nd pile has M2 stones,.. . And the n-th pile contain Mn stones. Agrael and Animal take turns to move and in each move each of the players can take at most L1 stones from the 1st pile or Take the to L2 stones from the 2nd pile or ... or take Ln stones from the n-th pile. The player takes the last stone wins.
After Agrael and Animal has played the game for months, the teacher finally got angry and decided to punish them. But when he knows the rule of the game, he's so interested in this game that he asks Agrael to play the game with him and If Agrael wins, he won ' t is punished, can agrael win the game if the teacher and Agrael both take the best move in their Turn?
The teacher always moves first (-_-), and the turn a player must takes at least 1 stones and they can ' t take stones fro M more than one piles.
Inputthe First line contains the number of test cases. Each test cases begin with the number n (n≤10), represent there is n piles. Then there is n lines follows, the i-th line contains the numbers Mi and Li (20≥mi > 0, 20≥li > 0).
Outputyour program output one line per case, if Agrael can win the game print "Yes", else print "No".
Sample Input
215 421 12 2
Sample Output
YesNo
Author[email protected]
Water Question ~ code:
#include <stdio.h>int main () {int t; scanf ("%d", &t), while (t--) {int n, m, l, sg = 0; scanf ("%d", &n); int i = 0; I < n; ++i) {scanf ("%d%d", &m,&l); SG ^= m% (l+1);} if (sg = = 0) {puts ("yes");} Else{puts ("No");}} return 0;}
with June
hdu1851 A Simple Game Bash game +nim game
