Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 4933 | Accepted: 2747 |
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
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
Regionals 2000 >> North America - Mid-Central USA
问题链接:POJ1575 HDU1039 ZOJ1698 UVALive2062 Easier Done Than Said?
问题简述:(略)
问题分析:
输入若干字符串进行判定,直到输入"end"为止。
判定分为以下三种:
1.至少有一个元音;
2.不能有三个连续元音或辅音;
3.不能有连续两个相同字母,除非ee或oo。
程序说明:(略)
题记:(略)
参考链接:(略)
AC的C++语言程序如下:
/* POJ1575 HDU1039 ZOJ1698 UVALive2062 Easier Done Than Said? */
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 20;
char s[N + 1];
// 元音判定
bool isvowel(char c)
{
return c == 'a' || c == 'e' || c== 'i' || c == 'u' || c == 'o';
}
// 至少有一个元音
bool judge1(char s[])
{
for(int i=0; s[i]; i++)
if(isvowel(s[i]))
return true;
return false;
}
// 不能有三个连续元音或辅音
bool judge2(char s[])
{
if(s[0] && s[1] && s[2]) {
for(int i=2; s[i]; i++) {
if(isvowel(s[i - 2]) && isvowel(s[i - 1]) && isvowel(s[i]))
return false;
if(!isvowel(s[i - 2]) && !isvowel(s[i - 1]) && !isvowel(s[i]))
return false;
}
}
return true;
}
// 不能有连续两个相同字母,除非ee或oo
bool judge3(char s[])
{
if(s[0] && s[1]) {
for(int i=1; s[i]; i++)
if(s[i] == s[i-1] && s[i] !='e' && s[i] != 'o')
return false;
}
return true;
}
int main()
{
while(~scanf("%s", s) && strcmp(s, "end") != 0) {
if(!judge1(s))
printf("<%s> is not acceptable.\n", s);
else if(!judge2(s))
printf("<%s> is not acceptable.\n", s);
else if(!judge3(s))
printf("<%s> is not acceptable.\n", s);
else
printf("<%s> is acceptable.\n", s);
}
return 0;
}