Codeforces-SolutionsA/Codes/1703 B - ICPC Balloons/1703B.cpp
ShazidMahsrafi a31f744f07 update
2024-06-22 00:19:11 +06:00

34 lines
624 B
C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
int n;
string s;
vector<int>v(26,0);
cin>>n>>s;
int ans=0;
for(auto x:s)
{
if(v[x-'A']==0)
ans++;
v[x-'A']++;
ans++;
}
cout<<ans<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}