4 条题解

  • 0
    @ 2025-4-15 15:55:13

    #include <bits/stdc++.h> using namespace std; string sl; int k1,k2,k3=0; int main(){ cin>>sl; int n=sl.length(); for(int i=0;i<n;i++){ if(sl[i]'a' or sl[i]'A'){ k1+=1; } if(sl[i]'b' or sl[i]'B'){ k2+=1; } if(sl[i]'c' or sl[i]'C'){ k3+=1; } } cout<<"a "<<k1<<endl; cout<<"b "<<k2<<endl; cout<<"c "<<k3<<endl;

    return 0;
    

    }

    • 0
      @ 2025-4-15 15:07:59

      #include <bits/stdc++.h> using namespace std; int a[3]; string s1; int main() { cin>>s1; for(int i=0;i<s1.length();i++){ if('a'<=s1[i] &&s1[i]<='c'){ int k=s1[i]-'a'; a[k]+=1; } if('A'<=s1[i]&& s1[i]<='c'){ int k=s1[i]-'A'; a[k]+=1; } }

      cout <<"a"<<" "<<a[0]<< endl;
      cout << "b"<<" "<<a[1]<< endl;
      cout << "c"<<" "<<a[2]<< endl;
      return 0;
      

      }

      • 0
        @ 2025-4-15 15:00:31

        #include<bits/stdc++.h>

        using namespace std;

        int a[3];

        string s1;

        int main(){

        cin>>s1;
        
        for(int i=0; i<s1.length(); i++){
        
            if('a'<=s1[i] && s1[i]<='c'){
                int k=s1[i]-'a';
                a[k]+=1;
            }
            if('A'<=s1[i] && s1[i]<='C'){
                int k=s1[i]-'A';
                a[k]+=1;
            }
        }
        cout<<"a "<<a[0]<<endl;
        cout<<"b "<<a[1]<<endl;
        cout<<"c "<<a[2]<<endl;
        return 0;
        

        }

        • 0
          @ 2025-4-15 14:59:49

          #include<bits/stdc++.h> using namespace std; int a[3]; string s1; int main(){ cin>>s1; for(int i=0; i<s1.length(); i++){ if('a'<=s1[i] && s1[i]<='c'){ int k=s1[i]-'a'; a[k]+=1; } if('A'<=s1[i] && s1[i]<='C'){ int k=s1[i]-'A'; a[k]+=1; } } cout<<"a "<<a[0]<<endl; cout<<"b "<<a[1]<<endl; cout<<"c "<<a[2]<<endl; return 0; }

          • 1

          信息

          ID
          972
          时间
          1000ms
          内存
          256MiB
          难度
          4
          标签
          (无)
          递交数
          274
          已通过
          129
          上传者