7 条题解
-
1
确实挺不错的
s = input() alphabet = ['A','B','C','D','a','b','c','d'] list = [0] * 4 dic={'A':0,'B':1,'C':2,'D':3,'a':0,'b':1,'c':2,'d':3} for i in s: if i in alphabet: list[dic[i]] += 1 elif i == '#': break for i in range(len(list)): m = max(list) for j in range(len(list)): if list[j] == m: print(chr(j + 65) + ' : ' + str(list[j])) list[j] = -1 break
-
1
c++
#include <iostream> using namespace std; struct Node{ char nam; int num=0; }a[3]; int main() { int n; a[0].nam='A'; a[1].nam='B'; a[2].nam='C'; a[3].nam='D'; char c1; while (cin>>c1){ if(c1=='a' or c1=='A'){ a[0].num+=1; } if(c1=='b' or c1=='B'){ a[1].num+=1; } if(c1=='c' or c1=='C'){ a[2].num+=1; } if(c1=='D' or c1=='d'){ a[3].num+=1; } } if(a[0].num<a[1].num or (a[0].num==a[1].num && a[0].nam>a[1].nam)){ swap(a[0],a[1]); } if(a[0].num<a[2].num or (a[0].num==a[2].num && a[0].nam>a[2].nam)){ swap(a[0],a[2]); } if(a[1].num<a[2].num or (a[1].num==a[2].num && a[1].nam>a[2].nam)){ swap(a[1],a[2]); } if(a[0].num<a[3].num or (a[0].num==a[3].num && a[0].nam>a[3].nam)){ swap(a[0],a[3]); } if(a[1].num<a[3].num or (a[1].num==a[3].num && a[1].nam>a[3].nam)){ swap(a[1],a[3]); } if(a[2].num<a[3].num or (a[2].num==a[3].num && a[2].nam>a[3].nam)){ swap(a[2],a[3]); } cout <<a[0].nam<<" "<<':'<<' '<<a[0].num<<endl; cout <<a[1].nam<<" "<<':'<<' '<<a[1].num<<endl; cout <<a[2].nam<<" "<<':'<<' '<<a[2].num<<endl; cout <<a[3].nam<<" "<<':'<<' '<<a[3].num<<endl; return 0; }
-
0
s = input() alphabet = ['A','B','C','D','a','b','c','d'] list = [0] * 4 dic={'A':0,'B':1,'C':2,'D':3,'a':0,'b':1,'c':2,'d':3} for i in s: if i in alphabet: list[dic[i]] += 1 elif i == '#': break for i in range(len(list)): m = max(list) for j in range(len(list)): if list[j] == m: print(chr(j + 65) + ' : ' + str(list[j])) list[j] = -1 break
个人感觉莫名其妙就过了......
-
-1
using namespace std; int main(){ char a[4]={'A','B','C','D'}; int b[4]={0,0,0,0}; char c; while(cin>>c){ if(c=='A'||c=='a'){ b[0]++; } if(c=='B'||c=='b'){ b[1]++; } if(c=='C'||c=='c'){ b[2]++; } if(c=='D'||c=='d'){ b[3]++; } if(c=='#'){ break; } } for(int i=1;i<=1000;i++){ for(int j=0;j<=3;j++){ if(b[j]>b[j-1]){ swap(a[j],a[j-1]); swap(b[j],b[j-1]); } } } cout<<a[0]<<" "<<":" <<" "<<b[0]<<endl<<a[1]<<" "<<":" <<" "<<b[1]<<endl<<a[2]<<" "<<":" <<" "<<b[2]<<endl<<a[3]<<" "<<":" <<" "<<b[3]; return 0; }
-
-1
#include<bits/stdc++.h> using namespace std; int main() { int n,a[4]= {0,0,0,0},b=0,c=0,ba=0,bb=0,bc=0,bd=0; char m; while(cin>>m) { if(m=='a'||m=='A') { a[0]++; ba++; } else if(m=='b'||m=='B') { a[1]++; bb++; } else if(m=='c'||m=='C') { a[2]++; bc++; } else if(m=='d'||m=='D') { a[3]++; bd++; } } sort(a,a+3); for(int i=3; i>=0; i--) { if(a[i]==ba) { cout<<'A'<<" "<<":"<<" "<<a[i]<<endl; ba+=9999; } if(a[i]==bb) { cout<<'B'<<" "<<":"<<" "<<a[i]<<endl; bb+=9999; } if(a[i]==bc) { cout<<'C'<<" "<<":"<<" "<<a[i]<<endl; bc+=9999; } if(a[i]==bd) { cout<<'D'<<" "<<":"<<" "<<a[i]<<endl; bd+=9999; } } }
-
-2
#include #include #include #include using namespace std; int a;
struct P{ int m; char name; }e[5]; int cmp(P x,P y) { if(x.m<y.m) { swap(x,y); } else if(x.m==y.m&&x.name>y.name){ swap(x,y); } }
int main() { string a; cin>>a; e[0].name='A'; e[1].name='B'; e[2].name='C'; e[3].name='D'; for(int i=0;i<a.length();i++) { if(a[i]'A'||a[i]'a') { e[0].m++; } if(a[i]'B'||a[i]'b') { e[1].m++; } if(a[i]'C'||a[i]'c') { e[2].m++; } if(a[i]'D'||a[i]'d') { e[3].m++; } } for(int i=0;i<=3;i++) { for(int j=i+1;j<=3;j++) { if(e[i].m<e[j].m or (e[i].m==e[j].m and e[i].m>e[j].name)) { swap(e[i].m,e[j].m); char t=e[i].name; e[i].name=e[j].name; e[j].name=t; } } }
/*if(e[0].m<e[1].m or (e[0].m==e[1].m&&e[0].name>e[1].name)) {swap(e[0],e[1]);} if(e[0].m<e[2].m or (e[0].m==e[2].m&&e[0].name>e[2].name)) {swap(e[0],e[2]);} if(e[0].m<e[3].m or (e[0].m==e[3].m&&e[0].name>e[3].name)) {swap(e[0],e[3]);} if(e[1].m<e[2].m or (e[1].m==e[2].m&&e[1].name>e[2].name)) {swap(e[1],e[2]);} if(e[1].m<e[3].m or (e[1].m==e[3].m&&e[1].name>e[3].name)) {swap(e[1],e[3]);} if(e[2].m<e[3].m or (e[2].m==e[3].m&&e[2].name>e[3].name)) {swap(e[2],e[3]);}*/ for(int i=0;i<=3;i++) { cout<<e[i].name<<" : "<<e[i].m; cout<<endl; } return 0;
}
-
-2
#include #include
using namespace std; const int maxt=1001; int a[maxt]={0}; int main() {
string s; cin >>s; for(int i=0;i<s.length();i++){ if(s[i]=='a'||s[i]=='A'){a[1]++;} if(s[i]=='b'||s[i]=='B'){a[2]++;} if(s[i]=='c'||s[i]=='C'){a[3]++;} if(s[i]=='d'||s[i]=='D'){a[4]++;} } if(a[1]>=a[2]&&a[1]>=a[3]&&a[1]>=a[4]){ cout <<"A"<<" "<<":"<<" "<<a[1]<<endl; if(a[2]>=a[3]&&a[2]>=a[4]){ cout <<"B"<<" "<<":"<<" "<<a[2]<<endl; if(a[3]>=a[4]){cout <<"C"<<" "<<":"<<" "<<a[3]<<endl<<"D"<<" "<<":"<<" "<<a[4]<<endl;} else{cout <<"D"<<" "<<":"<<" "<<a[4]<<endl<<"C"<<" "<<":"<<" "<<a[3]<<endl;} } if(a[3]>a[2]&&a[3]>=a[4]){ cout <<"C"<<" "<<":"<<" "<<a[3]<<endl; if(a[2]>=a[4]){cout <<"B"<<" "<<":"<<" "<<a[2]<<endl<<"D"<<" "<<":"<<" "<<a[4]<<endl;} else{cout <<"D"<<" "<<":"<<" "<<a[4]<<endl<<"B"<<" "<<":"<<" "<<a[2]<<endl;} } if(a[4]>a[2]&&a[4]>a[3]){ cout <<"D"<<" "<<":"<<" "<<a[4]<<endl; if(a[2]>=a[3]){cout <<"B"<<" "<<":"<<" "<<a[2]<<endl<<"C"<<" "<<":"<<" "<<a[3]<<endl;} else{cout <<"C"<<" "<<":"<<" "<<a[3]<<endl<<"B"<<" "<<":"<<" "<<a[2]<<endl;} } } if(a[2]>a[1]&&a[2]>=a[3]&&a[2]>=a[4]){ cout <<"B"<<" "<<":"<<" "<<a[2]<<endl; if(a[1]>=a[3]&&a[1]>=a[4]){ cout <<"A"<<" "<<":"<<" "<<a[1]<<endl; if(a[3]>=a[4]){cout <<"C"<<" "<<":"<<" "<<a[3]<<endl<<"D"<<" "<<":"<<" "<<a[4]<<endl;} else{cout <<"D"<<" "<<":"<<" "<<a[4]<<endl<<"C"<<" "<<":"<<" "<<a[3]<<endl;} } if(a[3]>a[1]&&a[3]>=a[4]){ cout <<"C"<<" "<<":"<<" "<<a[3]<<endl; if(a[1]>=a[4]){cout <<"A"<<" "<<":"<<" "<<a[1]<<endl<<"D"<<" "<<":"<<" "<<a[4]<<endl;} else{cout <<"D"<<" "<<":"<<" "<<a[4]<<endl<<"A"<<" "<<":"<<" "<<a[1]<<endl;} } if(a[4]>a[1]&&a[4]>a[3]){ cout <<"D"<<" "<<":"<<" "<<a[4]<<endl; if(a[1]>=a[3]){cout <<"A"<<" "<<":"<<" "<<a[1]<<endl<<"C"<<" "<<":"<<" "<<a[3]<<endl;} else{cout <<"C"<<" "<<":"<<" "<<a[3]<<endl<<"A"<<" "<<":"<<" "<<a[1]<<endl;} } } if(a[3]>a[1]&&a[3]>a[2]&&a[3]>=a[4]){ cout <<"C"<<" "<<":"<<" "<<a[3]<<endl; if(a[1]>=a[2]&&a[1]>=a[4]){ cout <<"A"<<" "<<":"<<" "<<a[1]<<endl; if(a[2]>=a[4]){cout <<"B"<<" "<<":"<<" "<<a[2]<<endl<<"D"<<" "<<":"<<" "<<a[4]<<endl;} else{cout <<"D"<<" "<<":"<<" "<<a[4]<<endl<<"B"<<" "<<":"<<" "<<a[2]<<endl;} } if(a[2]>a[1]&&a[2]>=a[4]){ cout <<"B"<<" "<<":"<<" "<<a[2]<<endl; if(a[1]>=a[4]){cout <<"A"<<" "<<":"<<" "<<a[1]<<endl<<"D"<<" "<<":"<<" "<<a[4]<<endl;} else{cout <<"D"<<" "<<":"<<" "<<a[4]<<endl<<"A"<<" "<<":"<<" "<<a[1]<<endl;} } if(a[4]>a[1]&&a[4]>a[2]){ cout <<"D"<<" "<<":"<<" "<<a[4]<<endl; if(a[1]>=a[2]){cout <<"A"<<" "<<":"<<" "<<a[1]<<endl<<"B"<<" "<<":"<<" "<<a[2]<<endl;} else{cout <<"B"<<" "<<":"<<" "<<a[2]<<endl<<"A"<<" "<<":"<<" "<<a[1]<<endl;} } } if(a[4]>a[1]&&a[4]>a[2]&&a[4]>a[3]){ cout <<"D"<<" "<<":"<<" "<<a[4]<<endl; if(a[1]>=a[2]&&a[1]>=a[3]){ cout <<"A"<<" "<<":"<<" "<<a[1]<<endl; if(a[2]>=a[3]){cout <<"B"<<" "<<":"<<" "<<a[2]<<endl<<"C"<<" "<<":"<<" "<<a[3]<<endl;} else{cout <<"C"<<" "<<":"<<" "<<a[3]<<endl<<"B"<<" "<<":"<<" "<<a[2]<<endl;} } if(a[2]>a[1]&&a[2]>=a[3]){ cout <<"B"<<" "<<":"<<" "<<a[2]<<endl; if(a[1]>=a[3]){cout <<"A"<<" "<<":"<<" "<<a[1]<<endl<<"C"<<" "<<":"<<" "<<a[3]<<endl;} else{cout <<"C"<<" "<<":"<<" "<<a[3]<<endl<<"A"<<" "<<":"<<" "<<a[1]<<endl;} } if(a[3]>a[1]&&a[3]>a[2]){ cout <<"C"<<" "<<":"<<" "<<a[3]<<endl; if(a[1]>=a[2]){cout <<"A"<<" "<<":"<<" "<<a[1]<<endl<<"B"<<" "<<":"<<" "<<a[2]<<endl;} else{cout <<"B"<<" "<<":"<<" "<<a[2]<<endl<<"A"<<" "<<":"<<" "<<a[1]<<endl;} } }
}
- 1
信息
- ID
- 86
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- 7
- 标签
- 递交数
- 576
- 已通过
- 136
- 上传者