hdu 1039 Easier Done Than Said?
来源:互联网 发布:商务通软件 编辑:程序博客网 时间:2024/06/04 19:11
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.
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
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.<houctuh> is acceptable.
Source
Mid-Central USA 2000
Recommend
We have carefully selected several similar problems for you: 1073 1043 1088 1113 1075
细心点就好,仔细看看第三条
#include <stdio.h>#include <string.h>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<len;i++){if(str[i]=='a'||str[i]=='e'||str[i]=='i'||str[i]=='u'||str[i]=='o'){flag1++;flag2=0;count++;}if(flag1>=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);elseprintf("<%s> is acceptable.\n",str);memset(str,0,sizeof(str));}}
0 0
- hdu 1039 Easier Done Than Said?
- HDU 1039 Easier Done Than Said?
- HDU 1039 - Easier Done Than Said?
- Hdu 1039 - Easier Done Than Said?
- hdu-1039Easier Done Than Said?
- HDU 1039 Easier Done Than Said? water~~~
- hdu 1039 Easier Done Than Said? 字符串
- Hdu---Easier Done Than Said---1039
- Easier Done Than Said? hdu 1039
- HDU--1039 -- Easier Done Than Said?
- HDU 1039 Easier Done Than Said?
- Easier Done Than Said?(hdu 1039)
- HDU 1039 Easier Done Than Said?
- hdu 1039 Easier Done Than Said?
- HDU 1039 Easier Done Than Said?
- hdu 1039 Easier Done Than Said?
- hdu 1039 Easier Done Than Said?
- HDU--1039:Easier Done Than Said? (字符串)
- week9---11月3日 div 布局综合练习、JS基础
- JDK8安装时错误1335的解决
- 最长上升子序列O(nlogn)
- SQL
- 利用反射获取Java类中的静态变量名及变量值
- hdu 1039 Easier Done Than Said?
- Java中的switch-case语句
- 苹果开发 笔记(86)Stack View in xcode 7
- hdu 1800 Flying to the Mars(贪心)
- nyoj整数划分(二)
- C++局部对象的析构
- 虚函数、纯虚函数详解
- LeJOS学习(8):Sensor的API研究-InfraRedSensor
- [BZOJ1782] [Usaco2010 Feb]slowdown 慢慢游