TOJ 3516.Game of Stones

题目链接: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.

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");
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值