Codeforces Round #792 (Div. 1 + Div. 2) 1684A - Digit Minimization Solution

Problem Link: https://codeforces.com/contest/1684/problem/A 

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,i,l;

    cin>>t;

    while(t--)

    {

        string s;

        cin>>s;

        if(s.size()==2)

            cout<<s[1]<<endl;

        else

        {

             sort(s.begin(),s.end());

            cout<<s[0]<<endl;

        }

    }

}