HDU1039 Easier Done Than Said?
来源:互联网 发布:手机好莱坞特效软件 编辑:程序博客网 时间:2024/05/19 19:31
题目链接:HDU1039
/* 题目大意:验证所设密码可否接受,要求满足以下三个条件: 1、必须包含元音 2、三个连续的字母不能同时为元音或者辅音 3、两个连续的字母不能相同,其中"ee"."oo"除外*/#include <bits/stdc++.h>using namespace std;int main() { string s; while (cin >> s && s != "end") { int flag = 0; int p = s.size(); for (int i = 0; i<p; i++) { if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u') flag = 1; } int flag1 = 0; for (int i = 2; i<p; i++) { if ((s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u') && ((s[i-1] == 'a' || s[i-1] == 'e' || s[i-1] == 'i' || s[i-1] == 'o' || s[i-1] == 'u')) && (s[i-2] == 'a' || s[i-2] == 'e' || s[i-2] == 'i' || s[i-2] == 'o' || s[i-2] == 'u')) flag1 = 1; else if ((s[i] != 'a' && s[i] != 'e' && s[i] != 'i' && s[i] != 'o' && s[i] != 'u') && ((s[i-1] != 'a' && s[i-1] != 'e' && s[i-1] != 'i' && s[i-1] != 'o' && s[i-1] != 'u')) && (s[i-2] != 'a' && s[i-2] != 'e' && s[i-2] != 'i' && s[i-2] != 'o' && s[i-2] != 'u')) flag1 = 1; } int flag2 = 0; for (int i = 1; i<p; i++) { if (s[i] == s[i-1] && (s[i] != 'e'&& s[i] != 'o')) flag2 = 1; } //cout << flag << flag1 <<flag2 <<endl; if (flag == 1 && flag1 == 0 && flag2 == 0) cout << "<" << s << ">" << " is acceptable." << endl; else cout << "<" << s << ">" << " is not acceptable." << endl; s = ""; } return 0;}
1 0
- HDU1039:Easier Done Than Said?
- HDU1039:Easier Done Than Said?
- HDU1039 Easier Done Than Said?
- HDU1039 Easier Done Than Said?
- HDU1039 Easier Done Than Said?
- HDU1039 Easier Done Than Said?
- HDU1039 Easier Done Than Said?(java)
- HDU1039 - 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?
- MySql创建数据库
- 机器学习资源大全中文版
- 前端easyUI时间控件datebox小bug问题修复
- 求两圆相交的面积
- Android DiskLruCache 源码解析 硬盘缓存的绝佳方案
- HDU1039 Easier Done Than Said?
- 盘点六款逆天级效率工具,能帮创业公司节省50%时间成本
- 实现JavaScript中继承的三种方式
- 并查集
- leetcode 258- Add Digits
- MTK平台ATA测试LCM出现Not Support
- hdu1080(最长公共子序列变形)
- Android IntentService完全解析 当Service遇到Handler
- Java线程与Linux内核线程的映射关系