Result: Accepted
Time: 252ms
Memory: 1712kB
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
using namespace std;
int T,n,sum,flag,length;
const int maxn1=100010;
const int maxn2=55;
char str[maxn2];
char a[maxn2];
int main(){
scanf("%d",&T);
int temp=0;
while(T--){
scanf("%s",str);
length=strlen(str),sum=0;
strcpy(a,str);
temp++;
for(int i=0;i<length;i++){
if(a[i]=='a'||a[i]=='e'||a[i]=='i'||a[i]=='o'||a[i]=='u')
sum++;
}
printf("%d\n",sum);
}
return 0;
}