Codeforces 499B. Lecture Solution

  ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    #include <bits/stdc++.h>

    using namespace std;

    int main()

    {

        int m,nn;

        string t,n,nt;

        map<string,string>mp;

         cin>>nn>>m;

        while(m--)

        {

            cin>>t>>n;

            mp[t]=n;

        }

        while(nn--)

        {

            cin>>nt;

            if(nt.size()>mp[nt].size())

                cout<<mp[nt]<<" ";

            else

                cout<<nt<<" ";

        }

        cout<<endl;


    }


    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.