HDU Easier done than said?

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1039

I found myself not careful enough .. Write down many errors .. Debugging for half a day .... Rigorous thinking

 

Problem descriptionpassword 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, before t 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 using common/pronounceable words that are not acceptable.

 

Inputthe 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.

 

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

 

Sample Input

atvptouibontreszoggaxwiinqeephouctuhend

 

 

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.
 
# Include <iostream>
# Include <string. h>
Using namespace STD;
Int main ()
{
Char pass [100], end [4] = {"end"}, a [6] = {'A', 'E', 'I', 'O ', 'U '};
While (CIN> pass)
{Int T, K1, K2, I, j, k, n, B = 0;
If (strcmp (Pass, end) = 0)
Break;
Cout <"<" <pass <"> is ";
N = strlen (PASS );
T = 0;
For (I = 0; I <n & B! =-1; I ++)
{

If (pass [I]! = 'E' & pass [I]! = 'O') // except EE oo
If (pass [I] = pass [I + 1]) // Condition 3: two consecutive conditions cannot be the same
B =-1;
If (B! =-1)
{
K1 = 0; k2 = 0; // condition 2:
For (k = I; k <I + 3 & K <n; k ++) // three consecutive vowels or Three consonants
{// In fact, except for the first time, you only need to add one more at a time. Yes
B = k1;
For (j = 0; j <5; j ++)
If (pass [k] = A [J])
{
K1 ++;
T = 1; // condition 1: contains a vowel.
}
If (k1 = B)
K2 ++;
}
If (K1> 2 | k2> 2)
B =-1;
}
}
 
If (B =-1 | T = 0)
Cout <"not acceptable." <Endl;
Else
Cout <"acceptable." <Endl;

}
}