博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
HDU 1039 Easier Done Than Said?
阅读量:6307 次
发布时间:2019-06-22

本文共 2778 字,大约阅读时间需要 9 分钟。

Easier Done Than Said?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 12751    Accepted Submission(s): 6165

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
<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
 题目链接:
分析:

判读条件

1:有元音字母

2:不能三个连续元音或辅音

3.不能连续两个相同的字母,除非ee或oo

下面给出AC代码:

1 #include 
2 using namespace std; 3 int main() 4 { 5 char str[25]; 6 int a[25]; 7 while(scanf("%s",str)&&strcmp("end",str)) 8 { 9 int len=strlen(str);10 int flag=1;11 int sum=0;//sum 标记元音的个数12 for(int i=0;i
0&&str[i]==str[i-1]&&str[i]!='e'&&str[i]!='o')//2个连续的相同音,排除e/o24 {25 flag=0;26 break;27 }28 if(i>1&&a[i]==a[i-1]&&a[i-1]==a[i-2])// 连续三个相连的元音或辅音 注意 i满足的条件,29 {30 flag=0;31 break;32 }33 }34 if(sum&&flag)35 printf("<%s> is acceptable.\n",str);36 else printf("<%s> is not acceptable.\n",str);37 }38 return 0;39 }

 

转载地址:http://scsxa.baihongyu.com/

你可能感兴趣的文章
docker exec 与 docker attach 区别
查看>>
ubuntu 14.10下安装Thrift
查看>>
玩转Node.js单元测试
查看>>
JavaScript是如何工作的:使用MutationObserver跟踪DOM的变化
查看>>
源码编译OpenJDK8
查看>>
kubernetes修改节点名称
查看>>
Vue--实例方法 / 生命周期
查看>>
【剑指offer纪念版】-- 面试题目录
查看>>
在iphone下遇到的一些兼容性问题
查看>>
mybatis(5) -自定义sql拦截统计执行耗时
查看>>
U盘中了蠕虫病毒后清除蠕虫并恢复文件的方法
查看>>
Linux 文件的权限设置
查看>>
04、navicat无法连接阿里云mysql
查看>>
查看JVM使用的什么垃圾收集器
查看>>
讲述下 :LVM逻辑卷管理遇到的问题
查看>>
jquery实用博客
查看>>
ORACLE日期时间函数大全(一)
查看>>
wpf通用窗体模板
查看>>
快速切换到主线程更新UI的几种方法
查看>>
jsp页面
查看>>