Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
124908 程诺 统计字符数量 C++ Wrong Answer 1 MS 268 KB 3075 2025-07-12 16:51:50

Tests(0/10):


Code:

#include<bits/stdc++.h> using namespace std; char arr[1000]; int a[28]; int main(){ /** int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ int x=0; for(int j=1;j<=n;j++){ if(a[i] == a[j]){ x++; } } if(x%2!=0){ cout<<a[i]<<endl; break; } int n,k; cin>>n; for(int i=1;i<=n;i++){ cin>>k; a[k]++; } for(int i=1;i<=10000;i++){ while(a[i]>0){ cout<<i<<" "; a[i]--; } } int l,m,s,e; cin>>l>>m; //从起始位置0到终点位置l,都种上树木 for(int i=0;i<=l;i++){ a[i]=1; } //修地铁,砍树 for(int i=1;i<=m;i++){ cin>>s>>e; for(int j=s;j<=e;j++){ a[j] = 0;//砍掉 } } //最后统计还存活的树木 int cnt=0; for(int i=0;i<=l;i++){ if(a[i]==1){ cnt++; } } cout<<cnt; int n,k; int sum=0; cin>>n; while(n--){ cin>>k; a[k] = k;//各归其位 } //统计不重复的数字个数 for(int i=1;i<=1000;i++){ if(a[i>0]){ sum++; } } cout<<sum<<endl; for(int i=1;i<=1000;i++){ if(a[i]>0){ cout<<a[i]<<" "; } } char n; cin>>n; if(n>='A' and n<='Z'){ if( n=='A' or n=='E' or n=='I' or n=='O' or n=='U'){ cout<<"Upper Vowel"; } else if(n>='A' and n<='Z'){ cout<<"Upper Letter"; } }else if(n>='a' and n<='z'){ if(n=='a' or n=='e' or n=='i' or n=='o' or n=='u'){ cout<<"Lower Vowel"; }else if(n>='a' and n<='z'){ cout<<"Lower Letter"; } }else if(n>='0' and n<='9'){ cout<<"Digit"; }else{ cout<<"Other"; } char n; cin>>n; if(n-1>'126' and n-1<'32' or n+1>'126' or n-1<'32'){ cout<<n-1<<endl<<"Input Error!"; }else if(n-1>='32' and n-1<='126' or n+1>='32'and n+1<='126'){ cout<<n-1<<endl; } char n; cin>>n; if(n>='a' and n<='z'){ cout<<char(n-32); }else if(n>='A' and n<='Z'){ cout<<char(n+32); }else if(n>='0' and n<='9'){ cout<<n-'0'; }else{ cout<<"error"; } int n; int x=0;//求偶数和 int y=0;//求奇数和 cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]%2==0){ x++; }else{ y+=a[i]; } } cout<<y<<endl<<x; **/ // cin>>arr; // int len=strlen(arr);//求长度 // cout<<len<<endl;//输出长度 // cout<<arr; /** cin>>arr; cin>>brr; int len=strlen(arr); int ben=strlen(brr); if(len==ben){ cout<<"yes"; }else{ cout<<"no"; } cin>>arr; int len=strlen(arr); for(int i=0;i<=len/2;i++){ if(arr[i] != arr[len-1-i]){ cout<<"No"; return 0; } } cout<<"Yes"; cin>>arr; char A,B; cin>>A>>B; for(int i=0;i<strlen(arr);i++){ if(arr[i]==A){ arr[i] = B; } cout<<arr[i]; } //删去数字 cin.getline(arr,1000005); int len=strlen(arr); for(int i=0;i<len;i++){ if(arr[i]<'0'||arr[i]>'9'){ cout<<arr[i]; } } **/ cin>>arr; int len=strlen(arr); for(int i=0;i<len;i++){ a[arr[i]]++; } int max=0; char maxid; for(char c='a';c<='z';c++){ if(a[c]>max){ max = a[c]; maxid = c; } } cout<<max<<" "<<maxid<<endl; return 0; }


Run Info:

------Input------
svwdidkifwmtojpntabjgfvxudyivijuwuhanzccuaiestteksyyzdfbnnoniketllnjniqvxkkcqxtjkatxormrbpejqhadzffoyznyaqdesdosjvumdgfuezbjhpvsaqqzkycalzwwetglxtzyuskpjerwjrfvdoybvnhnwzmhsdifzeqmphilyshsqamfiykvbnvjxssomxizjvjqwymwzhmqeoymnihkqwulwfqtdptkyajtznxyvgsurhuuhuauimjixcrtargswyraxumocnnrlhuewsgnavkfihzhvfmaqnhjocldrqoknjlblzwriiuafowfvcwextycmdrxoqvebfjwvozijqwrdinrgzeqdrsoxaprgqjtbdwsufxawlhecgrgasnkxpfqzbmappzjrqxpbkvnbverqqabpjlnrrxbwematjcflxzlctdhqshgzqzrfxphpsucamdsekrwdimzwvpwwzdvzsipykhecunt
------Answer-----
w 50
------Your output-----
2020762766 u