Result: Accepted
Time: 317ms
Memory: 1712kB
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<math.h>
#include<string>
#include<set>
using namespace std;
const int maxn=1e5+50;
const int mod=998244353;
int main()
{
char ans[10]={'a','e','i','o','u'};
int T;
scanf("%d",&T);
while(T--)
{
char s[100];
scanf("%s",s);
int count=0;
int len=strlen(s);
for(int i=0;i<len;i++)
{
char temp=s[i];
for(int j=0;j<5;j++)
{
if(ans[j]==temp)
count++;
}
}
printf("%d\n",count);
}
return 0;
}