Accepted
Code
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n; cin>>n;
string s; cin>>s;
int a[n][26]={0};
int b[26]={0};
for(int i=0;i<n;i++)
{
b[s[i]-'a']++;
for(int j=0;j<26;j++)
{
a[i][j]=b[j];
}
}
int ans=0;
for(int i=0;i<n;i++)
{
int point = s[i]-'a';
for(int j=0;j<26;j++)
{
if(j==point) continue;
if(a[i][j]!=0 && a[i][j]*2==b[j])
{
ans++;
break;
}
}
}
cout<<ans<<endl;
}
int main(){int t; cin>>t; while(t--) solve();}
Information
- Submit By
- Type
- Submission
- Problem
- P1021 Pivot points
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-01-03 18:18:28
- Judged At
- 2024-11-11 03:44:35
- Judged By
- Score
- 100
- Total Time
- 14ms
- Peak Memory
- 1.496 MiB