#include<bits/stdc++.h>
using namespace std;int main (){int t; cin >> t;while(t --){
string s;char c;int left =0, right =0;
cin >> s >> c;int flag =0;for(int i =0; i < s.length(); i ++){if(s[i]== c){
left = i;
right = s.length ()- i -1;if(left %2==0&& right %2==0){
flag =1;break;}}}if(flag) cout <<"YES"<< endl;else cout <<"NO"<< endl;}return0;}
#include<cstdio>#include<cmath>#include<algorithm>usingnamespace std;typedeflonglong LL;int main (){int t; scanf ("%d",&t);while(t --){
LL l, r, a;
scanf ("%lld%lld%lld",&l,&r,&a);
LL zero =0;
LL k =(r +1- a)/ a;
LL sum = k * a + a -1;
LL ans = sum / a + sum % a;if(sum >= l && sum <= r)
printf ("%lld\n", ans);else{
LL mod1 = l / a, mod2 = r / a;if(mod1 == mod2)
printf ("%lld\n", r / a + r % a);else
printf ("%lld\n", max (r /a + r % a, a *(mod2 -1)+ a -1));}}}
A Deletions of Two Adjacent Letters题意:给定一个字符串s和一个字符c,问经过任意次操作能否将s变成c,操作为每次选中字符串中相邻两个字符进行删除思路:从操作的特点入手,因为最终只剩下字符c,说明c在字符串s中左边的字符和右边的字符都被删除,又因为每次操作是选中相邻的两个字符进行删除,说明在字符串s中c所在位置左边和右边的字串长度都为偶数,遍历字符串找到所有c进行判断,有一个满足则满足代码#include <bits/stdc++.h>using na