Start: Jun, 28, 2019 08:42:00
2019杭州师范大学第一届程序设计竞赛新生赛
End: Jun, 28, 2019 11:42:00
Time elapsed:
Time remaining:

Problem_ID: B
Result: Accepted
Time: 245ms
Memory: 2988kB
In contest: 1276

#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;++i)
#define dep(i,x,y) for(int i=y;i>=x;--i)
using namespace std;
typedef long long ll;
//struct node{
//	int 
//}p[];
//bool cmp(node a,node b)
//{
//	return ;
//}
int n,m,k,q,a[301010];
char s[101010];
int main()
{
	int t,an,l;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%s",s);
		an=0;
		l=strlen(s);
		rep(i,0,l-1)
		   if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u') an++;
		printf("%d\n",an);
	}
	
}