POJ 1575 Easier Done Than Said? G++

#include <iostream>
#include <cstring>
using namespace std;
int main()
{
	string a[1000];
	int n=0;
	while(1)//输入 
	{
		cin>>a[n];
		if(a[n]=="end")
		{
			break;
		}
		n++;
	}
	int b[n];
	memset(b,0,sizeof(b));
	for(int i=0;i<n;i++)
	{
		int hi1=0;
		int hi21=0;
		int hi22=0;
		int hi3=0;
		for(int j=0;j<a[i].size();j++)
		{
			if((hi1==0)&&((a[i][j]=='a')||(a[i][j]=='e')||(a[i][j]=='i')||(a[i][j]=='o')||(a[i][j]=='u')))
			{
				hi1=1;//ok
			}
		}
		if(a[i].size()>=3)
		{
			for(int j=0;j<a[i].size()-2;j++)
			{
				if((hi21==0)&&((a[i][j]=='a')||(a[i][j]=='e')||(a[i][j]=='i')||(a[i][j]=='o')||(a[i][j]=='u'))
				&&((a[i][j+1]=='a')||(a[i][j+1]=='e')||(a[i][j+1]=='i')||(a[i][j+1]=='o')||(a[i][j+1]=='u'))
				&&((a[i][j+2]=='a')||(a[i][j+2]=='e')||(a[i][j+2]=='i')||(a[i][j+2]=='o')||(a[i][j+2]=='u')))
				{
					hi21=1;//no
					break;
				}
				if((hi22==0)&&(a[i][j]!='a')&&(a[i][j]!='e')&&(a[i][j]!='i')&&(a[i][j]!='o')&&(a[i][j]!='u')
				&&(a[i][j+1]!='a')&&(a[i][j+1]!='e')&&(a[i][j+1]!='i')&&(a[i][j+1]!='o')&&(a[i][j+1]!='u')
				&&(a[i][j+2]!='a')&&(a[i][j+2]!='e')&&(a[i][j+2]!='i')&&(a[i][j+2]!='o')&&(a[i][j+2]!='u'))
				{
					hi22=1;
					break;
				}
			}
		}

		for(int j=0;j<a[i].size()-1;j++)
		{
			if((hi3==0))
			{
				if((a[i][j]==a[i][j+1])&&(a[i][j]!='e')&&(a[i][j]!='o'))
				{
					hi3=1;//no
					break;
				}
			}
		}
		if((hi1==1)&&(hi21==0)&&(hi22==0)&&(hi3==0)) 
		{
			b[i]=1;//ok
		}
		//cout<<hi1<<" "<<hi21<<" "<<hi22<<" "<<hi3<<endl;
	}
	for(int i=0;i<n;i++)
	{
		
		if(b[i]==1)
		{
			cout<<"<"<<a[i]<<"> is acceptable."<<endl;
		}else
		{
			cout<<"<"<<a[i]<<"> is not acceptable."<<endl;
		}
		//cout<<a[i]<<endl;
	}
	return 0;
}