3 solutions
-
5
#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
-
0
#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
- 93
- Accepted
- 32
- Uploaded By
手机←