Codeforces Round #806 (Div. 4) 1703B. ICPC Balloons Solution


 

Problem Link: https://codeforces.com/contest/1703/problem/B

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()
{
    long long  x,t,i,j,o,e,n,cn;
    cin>>t;
    while(t--)
    {
        string s;
        cn=0;
        map<char,int>mp;
        cin>>n>>s;
        for(i=0;i<n;i++)
        {
          mp[s[i]]++;
          if(mp[s[i]]>1)
            cn++;
          else
          cn+=2;

        }
        cout<<cn<<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.