1223B - Strings Equalization - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
const int N=1e7+10;
vector<int> spf(N,0);
void div(int N)
{
for(int i=2;i<N;i++)  // Least divisor
{
    if(spf[i]==0)
    {
        for(int j=i;j<N;j+=i)
        {
            if(spf[j]==0)
            spf[j]=i;
        }
    }
}
}
int fact(int n) 
{
   if (n == 0 || n == 1)
   return 1;
   else
   return n * fact(n - 1);
}
long long int combination(long long int n,long long int r)
{
    long long int comb;
    comb = fact(n) / (fact(r) * fact(n-r)); 
    return comb;
    
}
long long int perumation(long long int n,long long int r)
{
    long long int per = fact(n) / fact(n-r);
    return per;
    
}
void solve()
{
    int flag=0;
    string s;
    string t;
    cin>>s>>t;
    set<char> st;
    for(int i=0;i<s.size();i++)
    st.insert(s[i]);
    for(int i=0;i<s.size();i++)
    {
        if(st.find(t[i])!=st.end())
        {
            cout<<"YES"<<endl;flag=1;
            break;
        }
    }
    if(flag==0)
    cout<<"NO"<<endl;

}
int main()
{  
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
   
    
}