1796B - Asterisk-Minor Template - CodeForces Solution


strings

Please click on ads to support us..

C++ Code:

#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main(){
    int t;
    cin >> t;

    while(t>0){
        --t;

        string a;
        cin >> a;

        string b;
        cin >> b;

        if(a[0] == b[0]){
            cout << "YES" << endl;
            cout << a[0] << "*" << endl;
            continue;
        }
 
        if(a[a.length()-1] == b[b.length()-1]){
            cout << "YES" << endl;
            cout << "*" << a[a.length()-1] << endl;
            continue;
        }
 
        bool found = false;
 
        for(int i=0;i<a.length()-1;i++){
            string f = std::string() + a[i] + a[i+1];
 
            if(b.find(f) != string::npos){
                if(f.length() < 2) break;
                found = true;
                cout << "YES" << endl;
                cout << "*" << f << "*" << endl;
                break;
            }
        }
 
        if(found) continue;

        cout << "NO" << endl;
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling