#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int isprime(int n){
int k = sqrt(n), i;
if ( n <= 1)
return 0;
else if ( n == 2)
return 1;
else{
for ( i = 2; i <= k; i++){
if ( n%i == 0)
return 0;
}
}
return 1;
}
int cmp( void const *a, void const *b){
return (*(int*)a) - (*(int*)b);
}
int main()
{
char arr1[202];
gets(arr1);
int i, len = strlen(arr1), cnt = 0, num[26]={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};
for ( i = 0; i < len; i++){
if (arr1[i] == ' ')
cnt++;
if (islower(arr1[i]))
cnt += num[arr1[i] - 'a'];
}
printf("%d", cnt);
return 0;
}
打表大法好