fjnu 1322 Easier Done Than Said?
来源:互联网 发布:考试酷软件下载 编辑:程序博客网 时间:2024/05/21 11:04
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
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.
KEY:这个题只要把握那三个规则,把三个规则作为上个条件,就很简单了;
Source:
#include<iostream>
using namespace std;
int isVowel(char c)
...{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u') return 1;
return 0;
}
int Ruel_1(char str[])
...{
int len=strlen(str);
for(int i=0;i<len;i++)
if(isVowel(str[i])) return 1;
return 0;
}
int Ruel_2(char str[])
...{
int len=strlen(str);
for(int i=0;i<len-2;i++)
...{
if(isVowel(str[i])&&isVowel(str[i+1])&&isVowel(str[i+2])) return 0;
if(!isVowel(str[i])&&!isVowel(str[i+1])&&!isVowel(str[i+2])) return 0;
}
return 1;
}
int Ruel_3(char str[])
...{
int len=strlen(str);
for(int i=0;i<len-1;i++)
...{
if(str[i]==str[i+1])
...{
if(str[i]=='e'||str[i]=='o') continue;
else return 0;
}
}
return 1;
}
void output(char str[],int a,int b,int c)
...{
if(a&&b&&c)
cout<<"<"<<str<<"> is acceptable."<<endl;
else cout<<"<"<<str<<"> is not acceptable."<<endl;
}
int main()
...{
// freopen("fjnu_1322.in","r",stdin);
char str[25];
cin>>str;
int a,b,c;
while(strcmp(str,"end"))
...{
a=Ruel_1(str);
b=Ruel_2(str);
c=Ruel_3(str);
output(str,a,b,c);
cin>>str;
}
return 0;
}
- fjnu 1322 Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- Easier Done Than Said?
- hdu Easier Done Than Said?
- 1039 Easier Done Than Said?
- 题目:Easier Done Than Said?
- HDU1039:Easier Done Than Said?
- TJU Easier Done than Said?
- HDU1039:Easier Done Than Said?
- 名言002
- 2008-2-19
- 十招搞定网站SEO
- 想写什么来着...
- 2007年浙江高考满分作文——行走在消逝中
- fjnu 1322 Easier Done Than Said?
- 东方通信(600776)
- Spring 的优秀工具类盘点,第 1 部分: 文件资源操作和 Web 相关工具类
- liferay portal4.4 glassfish 的安装
- 消费电子在奥运驱动下的七大热点应用
- Spring 的优秀工具类盘点,第 2 部分: 特殊字符转义和方法入参检测工具类
- fjnu 1298 Are We There Yet?
- 左右手互博的感觉
- 管理员身份获得 SYSTEM 权限的四种方法