Codeforces Round #790 (Div. 4) 1676C. Most Similar Words Solution



 Solution in C++: 

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int  t,n,m,i,j,r,sm;
    cin>>t;
    while(t--)
    {
        string s,a,b;
        sm=0;
        vector<string>vs;
        vector<int>vi;
        cin>>n>>m;
        for(i=0; i<n; i++)
        {
            cin>>s;
            vs.push_back(s);
        }
        for(i=0; i<vs.size(); i++)
        {
            for(j=i+1; j<vs.size(); j++)
            {
                sm=0;
                a=vs[i];
                b=vs[j];
                for(r=0; r<a.size(); r++)
                {
                    sm+=abs(int(a[r])-int(b[r]));

                }
                vi.push_back(sm);
            }
        }
        sort(vi.begin(),vi.end());
        cout<<vi[0]<<endl;
        vi.clear();
        vs.clear();
    }
}




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.