4 solutions

  • 5
    @ 2024-11-1 19:37:45
    #include<bits/stdc++.h>
    using namespace std;
    const int N=100010;
    char s[N];
    int main()
    {  
        cin.getline(s,N);
        int n=strlen(s);
        int cnt=0;
        for(int i=0;i<n;i++)
        {
         if(s[i]==' ')
    	 {
    		 cnt=cnt+1;
    	 }
    	 if(s[i]=='a'||s[i]=='d'||s[i]=='g'||s[i]=='j'||s[i]=='m'||s[i]=='p'||s[i]=='t'||s[i]=='w') 
    	 {
    	 	cnt=cnt+1; 
    	 }
    	 if(s[i]=='b'||s[i]=='e'||s[i]=='h'||s[i]=='k'||s[i]=='n'||s[i]=='q'||s[i]=='u'||s[i]=='x') 
    	 {
    	 	cnt=cnt+2; 
    	 }
    	 if(s[i]=='c'||s[i]=='f'||s[i]=='i'||s[i]=='l'||s[i]=='o'||s[i]=='r'||s[i]=='v'||s[i]=='y')
    	 {
    	 	cnt=cnt+3;
    	  } 
    	  if(s[i]=='s'||s[i]=='z')
    	  {
    	  	cnt=cnt+4; 
    	  }
    	}
    	cout<<cnt; 
    	return 0;
    }
    
    • 3
      @ 2024-7-25 14:52:11
      #include<bits/stdc++.h>
      using namespace std;
      int b[]={1,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4};
      char a[10000000];
      int main()
      {
          cin.getline(a,10000000);
          int n=strlen(a),cnt=0;
          for(int i=0;i<n;i++)
          {
              if(a[i]==' ') cnt++;
              else cnt+=b[int(a[i]-96)];
          }
          cout<<cnt;
      }
      

      手机←

      • @ 2025-1-12 11:08:22

        哥们写错了,应该是

        #include<bits/stdc++.h>
        using namespace std;
        const int nm=114514;
        char s[nm];
        int a[]={1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4};
        int main()
        {
        	cin.getline(s,nm);
        	int q=0;
        	for(int i=0;i<strlen(s);i++){
        		if(s[i]==' ') q++;
        		else q+=a[int(s[i]-97)];
        	}
        	cout<<q;
        	return 0;
        }
        
      • @ 2025-4-20 10:06:18

        @

      • @ 2025-4-20 10:06:45

        xzd

    • 0
      @ 2026-10-4 15:17:30

      #include<bits/stdc++.h> using namespace std; int main(){

      int a=0;
      char s[100001];
      cin.getline(s,100001);
      for(int i=0;i<strlen(s);i++){
      	if(s[i]=='a') a+=1;
      	if(s[i]=='b') a+=2;
      	if(s[i]=='c') a+=3;
      	if(s[i]=='d') a+=1;
      	if(s[i]=='e') a+=2;
      	if(s[i]=='f') a+=3;
      	if(s[i]=='g') a+=1;
      	if(s[i]=='h') a+=2;
      	if(s[i]=='i') a+=3;
      	if(s[i]=='j') a+=1;
      	if(s[i]=='k') a+=2;
      	if(s[i]=='l') a+=3;
      	if(s[i]=='m') a+=1;
      	if(s[i]=='n') a+=2;
      	if(s[i]=='o') a+=3;
      	if(s[i]=='p') a+=1;
      	if(s[i]=='q') a+=2;
      	if(s[i]=='r') a+=3;
      	if(s[i]=='s') a+=4;
      	if(s[i]=='t') a+=1;
      	if(s[i]=='u') a+=2;
      	if(s[i]=='v') a+=3;
      	if(s[i]=='w') a+=1;
      	if(s[i]=='x') a+=2;
      	if(s[i]=='y') a+=3;
      	if(s[i]=='z') a+=4;
      	if(s[i]==' ') a+=1;
      }
      cout<<a;
      
      return 0;
      

      }

      • -1
        @ 2026-3-21 10:28:34

        #include <bits/stdc++.h> using namespace std; const int N=100010; char s[N]; int main() { cin.getline(s,N); int n=strlen(s); int cnt=0; for(int i=0;i<n;i++) { if(s[i]' ') { cnt=cnt+1; } if(s[i]'a'||s[i]'d'||s[i]'g'||s[i]'j'||s[i]'p'||s[i]'t'||s[i]'w') { cnt=cnt+1; } if(s[i]'b'||s[i]'e'||s[i]'h'||s[i]'k'||s[i]'q'||s[i]'u'||s[i]'x') { cnt=cnt+2; } if(s[i]'c'||s[i]'f'||s[i]'i'||s[i]'l'||s[i]'o'||s[i]'v'||s[i]'y') { cnt=cnt+3; } if(s[i]'s'||s[i]'z') { cnt=cnt+4; } } cout<<cnt; return 0; }

        • 1

        Information

        ID
        87
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        112
        Accepted
        43
        Uploaded By