Submission #52321403

---

Source Code Expand

#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>


#define ll long long int
#define ull unsigned ll
#define lld double
#define str_lwr(x) transform(x.begin(),x.end(),x.begin(),::towlower)
#define str_upr(x) transform(x.begin(),x.end(),x.begin(),::towupper)
#define tc ll t;in t;while(t--)


#define vec(b,a,n) vector<b>a(n)
#define mpi(a,b,mp) map<a,b>mp
#define mi(mp) mp.insert
#define vecbool(is_prime,n) vector<bool>is_prime(n+1,true)
#define pb push_back
#define it(a) for(auto it : a)out it<<(char)32;
#define nl out endl
#define vecp(b) vector<pair<ll,ll>>b
#define iit(b) for(auto iit : b)out iit.first<<(char)32<<iit.second<<(char)32;
#define gcd __gcd
#define in cin>>
#define out cout<<
#define loopi(a,b,c) for(ll i=a;i<b;i+=c)
#define loopj(a,b,c) for(ll j=a;j<b;j+=c)
#define loopk(a,b,c) for(ll k=a;k<b;k+=c)
#define rloopi(a,b,c) for(ll i=a;i>=b;i-=c)


#define all(a) a.begin(),a.end()
#define max_value(a) *max_element(a.begin(),a.end())
#define max_index(a) max_element(a.begin(),a.end())-a.begin()
#define min_value(a) *min_element(a.begin(),a.end())
#define min_index(a) min_element(a.begin(),a.end())-a.begin()
#define b_s(a,x) binary_search(a.begin(),a.end(),x)
#define free(a,x1) count(a.begin(),a.end(),x1)
#define nsort(a) sort(a.begin(),a.end())
#define rsort(a) sort(a.rbegin(),a.rend())


#define PM_RIFAT ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);


#define M 1e9+7
//#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//#define ordered_multiset tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;



class solve
{
    private:
    public:
    solve();
};
solve::solve()
{
    string t,s;cin>>s>>t;
    str_upr(s);
    ll cnt=0;
    ll l=0,r=0;
    while(r<s.size())
    {
        if(t[l]==s[r])
        {
            ++cnt;
            ++l;
        }
        if(cnt==2)break;
        ++r;
    }
    if(cnt==2)cout<<"Yes\n";
    else cout<<"No\n";
}



int main()
{
    PM_RIFAT;
    solve ob;
    return 0;
}

Submission Info

Compile Error

Main.cpp: In constructor ‘solve::solve()’:
Main.cpp:66:12: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   66 |     while(r<s.size())
      |           ~^~~~~~~~~

Judge Result