hdu 1039 Easier Done Than Said?

超、凢脫俗 2022-05-30 06:08 139阅读 0赞

# Easier Done Than Said? #

**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)  
Total Submission(s): 14953 Accepted Submission(s): 7266**

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.

题目解析:

简单的字符串处理题目,很水,1A

代码:

#include <bits/stdc++.h>
    using namespace std;
    const int maxn = 1e6;
    
    char c[maxn];
    char y[5]= {'a','e','i','o','u'};
    
    bool is_yuanyin(char cc)
    {
        for(int i=0; i<5; i++)
            if(y[i]==cc)
                return true;
            return false;
    }
    int main()
    {
        //freopen("in.txt","r",stdin);
        string c;
        while(cin>>c)
        {
            if(c=="end") break;
            int cnt=0;
            int flag = 1;
            int len = c.length();
            for(int i=0; i<len; i++)
                for(int j=0; j<5; j++)
                    if(c[i]==y[j])
                        cnt++;                //判断是否至少有一个元音字母
            for(int i=0; i<len-2; i++)
            {
                if(is_yuanyin(c[i])&&is_yuanyin(c[i+1])&&is_yuanyin(c[i+2]))
                {
                    flag = 0;
                    break;
                }
                if(!is_yuanyin(c[i])&&!is_yuanyin(c[i+1])&&!is_yuanyin(c[i+2]))
                {
                    flag = 0;
                    break;
                }                               //判断连续三个元音,三个辅音
            }
    
            for(int i=0; i<len-1; i++)
            {
                if(c[i]==c[i+1]&&c[i]!='e'&&c[i]!='o')
                {
                    flag = 0;
                    break;                      //判断是否有两个连续相同的字母
                }
            }
            //cout<<cnt<<" "<<flag<<endl;
            if(cnt&&flag)
                cout<<"<"<<c<<"> is acceptable."<<endl;
    
            else
                cout<<"<"<<c<<"> is not acceptable."<<endl;
        }
        return 0;
    }