7 条题解

  • 1
    @ 2022-7-10 14:44:17

    太折磨了这个

    #include<bits/stdc++.h>
    using namespace std;
    int main() {
    	int n,a[3]= {0,0,0},b=0,c=0,ba=0,bb=0,bc=0;
    	char m;
    	cin>>n;
    	for(int i=1; i<=n; i++) {
    		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++;
    		}
    	}
    	sort(a,a+3);
    	for(int i=2; 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;
    		}
    	}
    }
    
    • 0
      @ 2025-3-4 15:06:59

      有点难

      • 0
        @ 2023-8-26 10:14:57

        奈何看不懂C++

        num = int(input())
        s = input()
        s = s[:num].lower()
        a, b, c = 0, 0, 0
        for n in s:
            if n == "a":
                a += 1
            elif n == "b":
                b += 1
            elif n == "c":
                c += 1
        t = [("a", a), ("b", b), ("c", c)]
        def c_sort(m):
            return (-m[1], m[0])
        t.sort(key=c_sort)
        for v in t:
            print(v[0], v[1])
        
        
        • 0
          @ 2023-7-17 7:46:33

          #include #include using namespace std;

          1. const int Maxn=40; int a[Maxn],n; int main() { string a; cin>>n>>a; int x1=0,x2=0,x3=0; for(int i=0;i<=n;i++){ if(a[i]'a'||a[i]'A'){ x1+=1; } if(a[i]'b'||a[i]'B'){ x2+=1; } if(a[i]'c'||a[i]'C'){ x3+=1; } } if(x1>=x2 &&x1>=x3){ cout<<"a"<<" "<<x1<<endl; cout<<"b"<<" "<<x2<<endl; cout<<"c"<<" "<<x3<<endl; } if(x1>=x2 &&x1>=x3 &&x3>x1){ cout<<"a"<<" "<<x1<<endl; cout<<"c"<<" "<<x3<<endl; cout<<"b"<<" "<<x2<<endl; } if(x2>x1 && x2>=x3 && x1>=x3){ cout<<"b"<<" "<<x2<<endl; cout<<"a"<<" "<<x1<<endl; cout<<"c"<<" "<<x3<<endl; } if(x2>x1 && x2>=x3 && x3>x1){ cout<<"b"<<" "<<x2<<endl; cout<<"c"<<" "<<x3<<endl; cout<<"a"<<" "<<x1<<endl; } if(x3>x1 && x3>x2 && x1>=x2){ cout<<"c"<<" "<<x3<<endl; cout<<"a"<<" "<<x1<<endl; cout<<"b"<<" "<<x2<<endl; } if(x3>x1 && x3>x2 && x2>x1){ cout<<"c"<<" "<<x3<<endl; cout<<"b"<<" "<<x2<<endl; cout<<"a"<<" "<<x1<<endl; } return 0; }
          • 0
            @ 2023-7-16 19:14:14
            #include <iostream>
            
            using namespace std;
            struct Node{
            char nam;
            int num=0;
             }a[3];
            int main() {
                int n;
                cin>>n;
                a[0].nam='a';
                a[1].nam='b';
                a[2].nam='c';
                char c1;
                for(int i=1;i<=n;i++){
                    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(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]);
            }
            cout <<a[0].nam<<" "<<a[0].num<<endl;
            cout <<a[1].nam<<" "<<a[1].num<<endl;
            cout <<a[2].nam<<" "<<a[2].num<<endl;
            
            return 0;
            }
            

            c++

            • 0
              @ 2023-7-16 15:55:13

              #include #include using namespace std;

              int main() { int n,a=0,b=0,c=0,i; string s1; cin >>n>>s1; for(i=0;i<n;i++){ if(s1[i]'a'||s1[i]'A'){a++;} if(s1[i]'b'||s1[i]'B'){b++;} if(s1[i]'c'||s1[i]'C'){c++;} } if(a>=b&&a>=c){if(b>=c){cout <<"a "<<a<<endl<<"b "<<b<<endl<<"c "<<c<<endl;} else{cout <<"a "<<a<<endl<<"c "<<c<<endl<<"b "<<b<<endl;} } if(b>a&&b>=c){if(a>=c){cout <<"b "<<b<<endl<<"a "<<a<<endl<<"c "<<c<<endl;} else{cout <<"b "<<b<<endl<<"c "<<c<<endl<<"a "<<a<<endl;} } if(c>a&&c>b){if(a>=b){cout <<"c "<<c<<endl<<"a "<<a<<endl<<"b "<<b<<endl;} else{cout <<"c "<<c<<endl<<"b "<<b<<endl<<"a "<<a<<endl;} } }

              • 0
                @ 2023-6-2 12:38:20

                #include

                using namespace std; struct Node{ char nam; int num=0; }a[3]; int main() { int n; cin>>n; a[0].nam='a';a[1].nam='b';a[2].nam='c'; char c1; for(int i=1;i<=n;i++){ 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(a[0].num<a[1].num or (a[0].numa[1].num && a[0].nam>a[1].nam)){swap(a[0],a[1]);} if(a[0].num<a[2].num or (a[0].numa[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]);} cout <<a[0].nam<<" "<<a[0].num<<endl; cout <<a[1].nam<<" "<<a[1].num<<endl; cout <<a[2].nam<<" "<<a[2].num<<endl;

                return 0;
                

                }

                • 1

                信息

                ID
                52
                时间
                1000ms
                内存
                128MiB
                难度
                7
                标签
                递交数
                944
                已通过
                242
                上传者