hdu 1039 Easier Done Than Said?(检查密码模拟)
来源:互联网 发布:java 车牌识别 编辑:程序博客网 时间:2024/06/05 09:58
//hdu 1039 Easier Done Than Said?(检查密码模拟)/*题意:给你一个密码是否接受?接受的条件:1、其中要有元音字母;2、不能连续出现3个元音字母或者3个辅音字母3、不能出现两个连续出现相同的字母:(除ee,oo之外)这题就是简单的模拟。*/#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N=50;char s[N];int len;bool ansac;bool isaeiou(char ss)//是否为元音字母{ if(ss=='a'||ss=='e'||ss=='i'||ss=='o'||ss=='u') { return true; } return false;}int main(){ while(scanf("%s",s)!=EOF) { if(strcmp(s,"end")==0) break; ansac=false; len=strlen(s); printf("<%s> ",s); for(int i=0;i<len;i++)//其中要有元音字母; { if(isaeiou(s[i])) { ansac=true; break; } } if(ansac==true)//不能连续出现3个元音字母或者3个辅音字母 { for(int i=0;i<len-2;i++) { if(isaeiou(s[i])&&isaeiou(s[i+1])&&isaeiou(s[i+2])) { ansac=false; break; } else if(!isaeiou(s[i])&&!isaeiou(s[i+1])&&!isaeiou(s[i+2])) { ansac=false; break; } } } if(ansac==true)//不能出现两个连续出现相同的字母:(除ee,oo之外) { for(int i=0;i<len-1;i++) { if(s[i]==s[i+1]&&(s[i]!='e'&&s[i]!='o')) { //puts("ddd"); ansac=false; break; } } } if(ansac==true) { puts("is acceptable."); } else { puts("is not acceptable."); } } return 0;}
0 0
- hdu 1039 Easier Done Than Said?(检查密码模拟)
- hdu 1039 Easier Done Than Said?(字符串模拟)
- HDU 1039 Easier Done Than Said?(String模拟)
- HDU 1039 Easier Done Than Said?(模拟)
- hdu 1039 Easier Done Than Said?
- HDU 1039 Easier Done Than Said?
- HDU 1039 - Easier Done Than Said?
- Hdu 1039 - Easier Done Than Said?
- hdu-1039Easier Done Than Said?
- HDU 1039 Easier Done Than Said? water~~~
- hdu 1039 Easier Done Than Said? 字符串
- Hdu---Easier Done Than Said---1039
- Easier Done Than Said? hdu 1039
- HDU--1039 -- Easier Done Than Said?
- HDU 1039 Easier Done Than Said?
- Easier Done Than Said?(hdu 1039)
- HDU 1039 Easier Done Than Said?
- hdu 1039 Easier Done Than Said?
- sqlmap
- 如何解决MySQL超过最大连接数问题
- 变换域中的离散时间系统
- jsp关于form表单为两个按钮设置不同action的问题
- 新建Storyboard 如何加载
- hdu 1039 Easier Done Than Said?(检查密码模拟)
- I/O重定向和管道
- 解决JSP URL请求中文乱码问题方法
- hibernate入门级
- Servlet之四 Session的了解和学习
- 进程的重启脚本
- hdu1395 2^x mod n = 1
- hdu 2045 不容易系列之(3)―― LELE的RPG难题
- 苹果与虫子