1650A - Deletions of Two Adjacent Letters - CodeForces Solution

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define improve ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
#define ll long long 
#define el '\n'
using namespace std;
bool cmp(pair < ll, ll > x, pair<ll, ll>y)
{
    return x.second > y.second; 
}
vector<int> pre(vector<int>arr)
{
    vector<int>prefix(arr.size() + 1, 0); 
    for (int i = 1; i < prefix.size(); i++)
    {
        prefix[i] = prefix[i - 1]+ arr[i-1];
    }
    return prefix; 
}
vector<int> suf(vector<int>arr)
{
    vector <int>suffix(arr.size() + 1, 0);
    for (int i = arr.size() - 1; i >= 0; i--)
    {
        suffix[i] = suffix[i + 1] + arr[i];
    }
    return suffix; 
}
int max_mod(int x, int y) {
	return y ? max_mod(y, x % y) : x;
}
int main()
{
	improve;
    ll n; cin >> n; 
    while (n--)
    {
        string name; cin >> name;
        char temp; cin >> temp;
        bool flag = false; 
        for (int i = 0; i < name.size(); i++)
        {
            if (temp == name[i] && (i % 2 == 0))
            {
                flag = true; 
                break; 
            }
        }
        if (flag)
            cout << "YES" << el;
        else
            cout << "NO" << el; 
    }
    
    return 0; 
}