Easier Done Than Said? hdu 1039

Easier Done Than Said?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6135    Accepted Submission(s): 3048

Problem Description

Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computer-generated passwords (like xvtpzyo), but users have a hard time remembering them and sometimes leave them written on notes stuck to their computer. One potential solution is to generate "pronounceable" passwords that are relatively secure but still easy to remember.

FnordCom is developing such a password generator. You work in the quality control department, and it's your job to test the generator and make sure that the passwords are acceptable. To be acceptable, a password must satisfy these three rules:

It must contain at least one vowel.

It cannot contain three consecutive vowels or three consecutive consonants.

It cannot contain two consecutive occurrences of the same letter, except for 'ee' or 'oo'.

(For the purposes of this problem, the vowels are 'a', 'e', 'i', 'o', and 'u'; all other letters are consonants.) Note that these rules are not perfect; there are many common/pronounceable words that are not acceptable.

 

Input

The input consists of one or more potential passwords, one per line, followed by a line containing only the word 'end' that signals the end of the file. Each password is at least one and at most twenty letters long and consists only of lowercase letters.

 

Output

For each password, output whether or not it is acceptable, using the precise format shown in the example.

 

Sample Input

  

   a
tv
ptoui
bontres
zoggax
wiinq
eep
houctuh
end
  

 

Sample Output

  

   <a> is acceptable.
<tv> is not acceptable.
<ptoui> is not acceptable.
<bontres> is not acceptable.
<zoggax> is not acceptable.
<wiinq> is not acceptable.
<eep> is acceptable.
<houctuh> is acceptable.
  

 

Source

Mid-Central USA 2000

 

 

 

这是个水题，但是想过不是那么简单的，思路很简单，但有时就是过不了

 

 

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int vowel(char c)
{
    char a[5]= {'a','e','i','o','u'};
    int i;
    for(i=0; i<5; i++)
    {
        if(c==a[i])
        {
            return 1;
        }
    }
    return 0;
}
int main()
{
    char a[100];
    while(scanf("%s",a)!=EOF)
    {
        if((a[0]=='e')&&(a[1]=='n')&&(a[2]=='d'))
        break;
        int flag1=0;
        int flag2=1,flag3=1;
        printf("<");
        int l=strlen(a);
        int i;
        for(i=0; i<l; i++)
            printf("%c",a[i]);
        printf(">");
        for(i=0;i<l;i++)
        {
             if(vowel(a[i]))
             flag1=1;
             if(i>1)
             {
                 if(((vowel(a[i-1]))&&(vowel(a[i-2]))&&(vowel(a[i])))||((vowel(a[i-1])==0)&&(vowel(a[i-2])==0)&&(vowel(a[i])==0)))
                 {
                     flag2=0;
                     break;
                 }
             }
             if(i>0)
             {
                 if((a[i]!='e')&&(a[i]!='o'))
                 {
                     if(a[i]==a[i-1])
                     {
                         flag3=0;
                         break;
                     }
                 }
             }
        }
         if(flag1&&flag2&&flag3)
         {
             printf(" is acceptable.\n");
         }
         else
         {
             printf(" is not acceptable.\n");
         }


    }
 return 0;
}