题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2027
算法特工队QQ群:979618872 (伸手党绕边,欢迎有良好基础的人加入)
//
// Created by Leo Lee on 2019/4/3.
//
#include <iostream>
#include <string>
using namespace std;
int main(){
int lines;
cin>>lines;
getchar();//吃掉回车
string str;
for(int i = 0;i<lines;i++){
int yuan[5]{0};
if (i == 0) ;
else cout<<endl;
getline(cin,str);//按行读取
for(char c:str){
switch (c){
case 'a': yuan[0]++;
break;
case 'e':yuan[1]++;
break;
case 'i':yuan[2]++;
break;
case 'o':yuan[3]++;
break;
case 'u':yuan[4]++;
}
}
cout<<"a:"<<yuan[0]<<"\ne:"<<yuan[1]<<"\ni:"<<yuan[2]<<"\no:"<<yuan[3]<<"\nu:"<<yuan[4]<<endl;
}
return 0;
}