poj 1575 Easier Done Than Said?
2011-11-21 21:16
288 查看
Easier Done Than Said?
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 3333
Accepted: 1833
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
Sample Output
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 3333
Accepted: 1833
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.
1: #include<iostream>
2: using namespace std;
3: int isVowel(char c)
4: {
5: if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
6: return 1;
7: return 0;
8: }
9:
10: int main()
11: {
12: char word[25];
13: int flag;
14: int i;
15: // freopen("E:\\c++\\oj\\t.txt","rt",stdin);
16: while(1)
17: {
18: cin>>word;
19: if(strcmp(word,"end")==0)
20: break;
21: flag=0;
22: int len=strlen(word);
23: for(i=0;i<len;i++)
24: {
25: if(isVowel(word[i]))
26: break;
27: }
28: if(i==len)
29: flag=1;
30: for(i=0;i<len-2;i++)
31: {
32: if(isVowel(word[i]) && isVowel(word[i+1]) && isVowel(word[i+2]))
33: flag=1;
34: if(!isVowel(word[i]) && !isVowel(word[i+1]) && !isVowel(word[i+2]))
35: flag=1;
36: }
37: for(i=0;i<len-1;i++)
38: {
39: if(word[i]==word[i+1] && word[i]!='e' && word[i]!='o')
40: {
41: flag=1;
42: break;
43: }
44: }
45: if(flag)
46: cout<<"<"<<word<<">"<<" is not acceptable."<<endl;
47: if(!flag)
48: cout<<"<"<<word<<">"<<" is acceptable."<<endl;
49: }
50: return 0;
51: }
52:
53:
相关文章推荐
- POJ 1575 Easier Done Than Said?(我的水题之路——三重标记)
- POJ 1575 && HDU 1039 Easier Done Than Said?(水~)
- poj-1575-Easier Done Than Said?
- POJ 1575 Easier Done Than Said? (简单模拟)
- POJ 1575 Easier Done Than Said? G++
- poj 1575 Easier Done Than Said?
- poj 1575 Easier Done Than Said?
- poj 1575 Easier Done Than Said?【字符串处理】
- hdu 1039 Easier Done Than Said?
- ZOJ 1698 Easier Done Than Said?
- hdoj 1039 Easier Done Than Said?(水题)
- HDOJ/HDU 1039 Easier Done Than Said?(字符串处理~)
- 杭电ACM1039——Easier Done Than Said?
- HDU1039 - Easier Done Than Said? (简单题)
- HDU 1039-Easier Done Than Said?(字符串)
- 1039 Easier Done Than Said?
- 杭电ACM OJ 1039 Easier Done Than Said? 水(但是很好玩的一道题,考察逻辑思维)
- ACM--元辅音--HDOJ 1039--Easier Done Than Said?--字符串
- HDU-1039-Easier Done Than Said?(Java && 没用正則表達式是我的遗憾.....)
- hdu Easier Done Than Said?