https://codeforces.com/contest/1104/problem/B

C++版本一

题解：类似于括号匹配的思想

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp;
int a[N];
char str[N];
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%s",str);
    //scanf("%d",&t);
    //while(t--){}
    stack<char>st;
    st.push(str[0]);
    int len=strlen(str);
    for(int i=1;i<len;i++){
        if(st.size()!=0&&st.top()==str[i]){
            st.pop();
            ans++;
        }else{
            st.push(str[i]);
        }
    }
    if(ans%2){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
    //cout << "Hello world!" << endl;
    return 0;
}