hdu 1851 A Simple Game
来源:互联网 发布:外文数据库有哪些 编辑:程序博客网 时间:2024/05/22 18:23
A Simple Game
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 1062 Accepted Submission(s): 655
Problem Description
Agrael likes play a simple game with his friend Animal during the classes. In this Game there are n piles of stones numbered from 1 to n, the 1st pile has 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 at most L2 stones from the 2nd pile or ... or take Ln stones from the n-th pile. The player who takes the last stone wins.
After Agrael and Animal have 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 is so interested in this game that he asks Agrael to play the game with him and if Agrael wins, he won't be 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 in each turn a player must takes at least 1 stones and they can't take stones from more than one piles.
After Agrael and Animal have 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 is so interested in this game that he asks Agrael to play the game with him and if Agrael wins, he won't be 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 in each turn a player must takes at least 1 stones and they can't take stones from more than one piles.
Input
The first line contains the number of test cases. Each test cases begin with the number n (n ≤ 10), represent there are n piles. Then there are n lines follows, the i-th line contains two numbers Mi and Li (20 ≥ Mi > 0, 20 ≥ Li > 0).
Output
Your 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
资料:http://blog.csdn.net/u014634338/article/details/38068771
巴什博奕和尼姆博弈的综合。
令Bi=Mi mod(Li+1)
定义T‘=B1 xor B2 xor ... xor Bn
如果T‘=0那么没有获胜可能,先取者必败
如果T’>0那么必然存在取的方法,使得T‘=0,
#include<stdio.h>#include <iostream>using namespace std;int main(){ int t,sum,n,m,L; cin>>t; while (t--) { cin>>n; sum=0; for (int i=0; i<n; i++) { cin>>m>>L; sum^=(m%(L+1)); } if(sum==0) { cout<<"Yes"<<endl; } else { cout<<"No"<<endl; } } return 0;}
0 0
- HDU 1851 - A Simple Game
- hdu 1851 A Simple Game
- hdu 1851 A Simple Game
- hdu A Simple Game(1851)
- HDU 1851 A Simple Game
- hdu 1851 A Simple Game
- HDU-1851-A Simple Game
- hdu 1851 A Simple Game SG定理
- HDU(1851) A Simple Game (博弈)
- hdu A Simple Stone Game
- hdu 1851 A Simple Game Java 水题系列 博弈
- hdu 1851 A Simple Game (Nim博弈)
- hdu 2486 A simple stone game
- 【hdu 2486】A simple stone game
- HDU 6237 A Simple Stone Game
- HDU 1848 Fibonacci again and again && HDU 1851 A Simple Game (基础sg函数)
- A Simple FPS Game
- UESTC1141 A Simple Game
- python中下划线的用法(单下划线和双下划线)
- python入门学习
- VLC-DSS搭建直播系统中链路断开影响测试
- 梦落的~
- hdoj.2013 蟠桃记 20140723
- hdu 1851 A Simple Game
- Weblogic之weblogic数据源配置及jndi调用
- php下载远程文件代码(curl ,支持重定向)
- 青年歌手大赛
- 杭电1026————搜索之优先队列
- 定义struct
- 小白学jquery Mobile《构建跨平台APP:jQuery Mobile移动应用实战》连载六-设计播放器APP
- 论文摘抄 - Tenzing
- 树状数组 boj 399. Who Is Joyful boj 395. Tree