hdu 1039 Easier Done Than Said?

hdu 1039 Easier Done Than Said?

Easier Done Than Said?

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

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

is acceptable. is not acceptable. is not acceptable. is not acceptable. is not acceptable. is not acceptable. is acceptable. is acceptable.

Source

​​Mid-Central USA 2000​​

Recommend

We have carefully selected several similar problems for you:   ​​1073​​​  ​​​1043​​​  ​​​1088​​​  ​​​1113​​​  ​​​1075​​

​​Statistic​​ |

​​Submit​​ |

​​Discuss​​ |

​​Note​​

细心点就好，仔细看看第三条

#include #include int main(){ char str[100]; while(scanf("%s",str)!=EOF) { if(strcmp("end",str)==0) break; int len=strlen(str),i; int flag1=0,flag2=0,count=0; for(i=0;i=3) break; if(str[i]==str[i+1]&&str[i]!='e'&&str[i]!='o') break; if(!(str[i]=='a'||str[i]=='e'||str[i]=='i'||str[i]=='u'||str[i]=='o')) { flag2++; flag1=0; } if(flag2>=3) break; } if(i!=len||count==0||flag1>=3||flag2>=3) printf("<%s> is not acceptable.\n",str); else printf("<%s> is acceptable.\n",str); memset(str,0,sizeof(str)); }}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。