Game with string(模拟)

题目
Two people are playing a game with a string s, consisting of lowercase latin letters.

On a player’s turn, he should choose two consecutive equal letters in the string and delete them.

For example, if the string is equal to “xaax” than there is only one possible turn: delete “aa”, so the string will become “xx”. A player not able to make a turn loses.

Your task is to determine which player will win if both play optimally.

Input
The only line contains the string s, consisting of lowercase latin letters (1≤|s|≤100000), where |s| means the length of a string s.

Output
If the first player wins, print “Yes”. If the second player wins, print “No”.

Examples

Input
abacaba
Output
No
Input
iiq
Output
Yes
Input
abba
Output
No

Note
In the first example the first player is unable to make a turn, so he loses.

In the second example first player turns the string into “q”, then second player is unable to move, so he loses.

一道简单的模拟题，只要看符合的字符串的次数是奇数还是偶数 通过移动一个指针遍历一次即可，注意如果找到了符合的字符串删去后指针要移动一下

AC代码

#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;

char str[100010];
int cnt,cur;

int main()
{
    scanf("%s",str);
    vector<char> a(str,str+strlen(str));
    for(int i = 0; i < a.size(); i++)
    {
        if(i != 0 && a[i] == a[i-1])
        {
            cur = i-2;
            a.erase(a.begin()+i-1,a.begin()+i+1);
            cnt++;
            if(cur-2 >= 0)
            {
                i = cur-3;
            }
            else
            {
                i = -1;
            }
        }

    }
    if(cnt%2==0)
    {
        printf("No\n");
    }
    else
    {
        printf("Yes\n");
    }
    return 0;
}