QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#151742 | #5422. Perfect Palindrome | wind# | AC ✓ | 32ms | 3648kb | C++20 | 1.1kb | 2023-08-27 14:12:24 | 2023-08-27 14:12:26 |
Judging History
answer
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define endl "\n"
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef pair<int, int> PII;
typedef unsigned long long ULL;
const int N = 1e6+5,mod=1e9+7,modd=998244353;
int ar[N],br[N];
int k, s,n,m,sum1,len;
int cmp(int a, int b){ return a > b;}
int lowbit(int x){return x&(-x);}
int read() { int x=0,f=1; char c=getchar(); while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();return x*f;}
const double eps = 1e-8;
signed main()
{
int t=1;
ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0);
cin>>t;
for(int ff=1;ff<= t;ff++)
{
int a, b,c,d, l, y, x, s, r,flag = 0,idx = 0,gg = 0,hh=0,res=0,sum=0, sum2 = 0;
string str2,str,str3;
// cin>>n>>m;
// for(int i=1;i<=n;i++)cin>>ar[i];
// sort(ar+1,ar+1+n);
cin>>str;
map<char,int>mp;
for(int i=0;i<str.length();i++)
{
mp[str[i]]++;
res=max(res,mp[str[i]]);
}
cout<<str.length()-res<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3472kb
input:
2 abcb xxx
output:
2 0
result:
ok 2 number(s): "2 0"
Test #2:
score: 0
Accepted
time: 32ms
memory: 3648kb
input:
11107 lfpbavjsm pdtlkfwn fmb hptdswsoul bhyjhp pscfliuqn nej nxolzbd z clzb zqomviosz u ek vco oymonrq rjd ktsqti mdcvserv x birnpfu gsgk ftchwlm bzqgar ovj nsgiegk dbolme nvr rpsc fprodu eqtidwto j qty o jknssmabwl qjfv wrd aa ejsf i npmmhkef dzvyon p zww dp ru qmwm sc wnnjyoepxo hc opvfepiko inuxx...
output:
8 7 2 8 4 8 2 6 0 3 7 0 1 2 5 2 4 6 0 6 2 6 5 2 5 5 2 3 5 6 0 2 0 8 3 2 0 3 0 6 5 0 1 1 1 2 1 8 1 7 5 3 4 4 1 8 5 5 8 8 6 3 0 2 3 2 1 5 0 0 9 3 3 4 8 4 0 4 2 6 6 0 8 7 4 3 9 3 4 2 5 8 8 8 6 1 4 4 2 7 2 8 6 4 4 8 7 8 4 9 3 8 0 7 7 2 6 0 0 5 4 0 7 5 4 2 1 6 7 5 2 4 4 7 3 3 2 5 4 8 5 0 3 5 1 2 3 0 4 7 ...
result:
ok 11107 numbers