HDU 1039(水题)

最新推荐文章于 2019-02-12 14:53:59 发布

acmdream

最新推荐文章于 2019-02-12 14:53:59 发布

阅读量537

点赞数

分类专栏：水题&模拟&规律文章标签： acm hdu 水题

本文链接：https://blog.csdn.net/acmdream/article/details/18180089

版权

水题&模拟&规律专栏收录该内容

48 篇文章 0 订阅

订阅专栏

题意:如题。

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;

bool vowel(char c)
{
    return c == 'a' || c == 'e' || c == 'i' 
        || c == 'o' || c == 'u';
}

bool consonant(char c)
{
    return !vowel(c);
}

bool except(char c)
{
    return c != 'e' && c != 'o';
}

void deal(string& line)
{
    bool vowel_exist = false;
    bool ok = true;
    for (int i = 0; i < line.length() && ok; ++i)
    {
        if (vowel(line[i]))
        {
            vowel_exist = true;
            if (i < line.length()-2 && vowel(line[i+1]) && vowel(line[i+2]))
                ok = false;
        }
        else
        {
            if (i < line.length()-2 && consonant(line[i+1]) && consonant(line[i+2]))
                ok = false;
        }
        if (i < line.length()-1 && line[i] == line[i+1] && except(line[i])) 
            ok = false;
    }
    if (!vowel_exist) ok = false;
    cout << "<" << line << ">" << " is " << (ok ? "" : "not ")
         << "acceptable." << endl;
}

int main()
{
    //freopen("1.txt", "r", stdin);
    string line;
    while (getline(cin, line))
    {
        if (line == "end")
            break;
        deal(line);
    }
    return 0;
}