hdoj1039
来源:互联网 发布:java能干嘛 编辑:程序博客网 时间:2024/05/16 05:37
Easier Done Than Said?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10462 Accepted Submission(s): 5055
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.
思路:看清题意,都满足3个要求即可,水过。。。
#include <stdio.h>#include <string.h>int main(){ char pass[100]; while(scanf("%s",pass)!=EOF) { if(strcmp(pass,"end") == 0) break; int i,flag1 = 0,flag2=1,flag3 = 1,vowels=0,consonants = 0,len=strlen(pass); for(i=0;i<len;i++) { if(pass[i] == 'a' || pass[i] == 'e' || pass[i] == 'i' || pass[i] == 'o' || pass[i] == 'u') { consonants = 0;//辅音不连续清零 flag1 = 1;//标记存在元音 vowels++; if(vowels >=3) flag2 = 0;//表示不通过 } else { vowels = 0;//元音不连续清零 consonants++;//辅音累加 if(consonants >=3) flag2 = 0;//表示不通过 } } for(i=1;i<len;i++) { if(pass[i-1] == pass[i]) { if(pass[i] == 'e' || pass[i] == 'o') continue;//根据题意要求这俩个跳过 flag3 = 0;//标记存在连续相同 } } if(flag1 && flag2 && flag3) printf("<%s> is acceptable.\n",pass); else printf("<%s> is not acceptable.\n",pass); } return 0;}
0 0
- hdoj1039
- hdoj1039简单题、字符串处理
- HDOJ1039 - Easier Done Than Said?
- 写android界面的感悟
- codeforces#292-C - Drazil and Factorial-数学规律题
- C++数组与指针详解
- Dapper,大规模分布式系统的跟踪系统
- tomcat之jsp/servlet容器与tomcat与专业的http服务器的区别
- hdoj1039
- Laravel报错:Session store not set on request.
- Java多线程 要点分析
- jasig CAS实现单点登录(数据库认证)
- 彩虹表与带盐Hash
- 微信提示redirect_uri参数错误
- Python中几个input方法
- Leetcode Generate Parentheses
- Tomcat源码分析(一)------ 架构