TOJ 3516.Game of Stones
2017-07-30 19:37
176 查看
题目链接:http://acm.tju.edu.cn/toj/showp3516.html
3516. Game of Stones
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 772 Accepted Runs: 308
Once a day, two people, A and B, played the game created by themselves again. Though they have played the game for many time, on the day something strange occured that B alway won the game. A was worried
about whether he could win the game for at least one time, so A ask you for some help. Here are the rules:
1. This is a game played by two players in turn; one of them plays first.(Actually A was always the first one)
2. The game uses two piles of stones as tools. In one turn, one of the players takes at least one stone away from either of the piles.
3. The game ends with all stones taken away, and the player played last turn win the game.
In order to win the game, A praicticed for so many times that he can count out all the stones of either pile. Now your mission is to tell whether A can win the game even though B is smart enough to take
the optional strategy.
Source: TJU Team Selection Contest
2010 (3)
3516. Game of Stones
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 772 Accepted Runs: 308
Once a day, two people, A and B, played the game created by themselves again. Though they have played the game for many time, on the day something strange occured that B alway won the game. A was worried
about whether he could win the game for at least one time, so A ask you for some help. Here are the rules:
1. This is a game played by two players in turn; one of them plays first.(Actually A was always the first one)
2. The game uses two piles of stones as tools. In one turn, one of the players takes at least one stone away from either of the piles.
3. The game ends with all stones taken away, and the player played last turn win the game.
In order to win the game, A praicticed for so many times that he can count out all the stones of either pile. Now your mission is to tell whether A can win the game even though B is smart enough to take
the optional strategy.
Input
There are several cases. Each case has one line containing two numbers: n, m indicating the number of either pile. 0 <= n, m < 10^50.Output
One line for each case with "Yes"(A could win) or "No"(A can't win).Sample Input
1 1 2 1
Sample Output
No Yes
Source: TJU Team Selection Contest
2010 (3)
#include <stdio.h> #include <iostream> #include <string> using namespace std; int main(){ string n,m; while(cin>>n>>m) (n==m) ? printf("No\n") : printf("Yes\n"); }
相关文章推荐
- TOJ--3483: Stones (水题)
- toj-3488-stones2(优先队列)
- TOJ 3484.Stones
- TOJ_1003题解
- toj 2798 Farey Sequence
- toj 2696 Collecting Beepers
- toj 3474 解题报告
- TOJ 2241. Ancestor 【判断一棵树上两个节点的关系】
- TOJ 1022
- POJ 2488 DFS+记录路径 TOJ 3520 BFS+记录路径
- TOJ 1547
- [Codeforces Round #162 (Div. 2)]A. Colorful Stones (Simplified Edition)
- HDU 1896 Stones(优先队列)
- hdu 4573 Throw the Stones
- [poj 2978]Colored Stones[状态压缩DP]
- TOJ 3445 POJ 2192 Zipper
- TOJ 2732存钱计划(三)(单源最短路)
- TOJ 4351 HDU 4259 Double Dealing
- TOJ 2921 古韵之鹊桥相会 / 深搜
- TOJ 3761 Egg Problem