ABC279A字符串统计

#include <stdio.h>
int n, m, i, j, k;
char s[105];
int main(){
    scanf("%s", s);
    for(i=0; s[i]; i++){
        if(s[i] == 'v') n++;
        else n += 2;//w有两个底
    }
    printf("%d\n", n);
    return 0;
}