hdoj 1039 Easier Done Than Said?

最新推荐文章于 2018-08-31 16:05:00 发布

原创最新推荐文章于 2018-08-31 16:05:00 发布 · 616 阅读

0 ·

CC 4.0 BY-SA版权

|--hdoj 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一种用于评估计算机生成的可发音密码是否符合特定安全和易记性的标准。密码必须包含至少一个元音，避免三个连续的元音或辅音，并且除了'ee'或'oo'外不允许两个相同的连续字母。

http://acm.hdu.edu.cn/showproblem.php?pid=1039

Easier Done Than Said?

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7554 Accepted Submission(s): 3737

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.
  
  
    
  
  
   #include<stdio.h>
#include<string.h>
int judge(char c)
{
    if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
    return 1;
    else
    return 0;
}
int main()
{
    int n,i,k1,k2,k3;
    char s[40];
    while(scanf("%s",s)&&strcmp(s,"end")!=0)
    {
            n=strlen(s);
            for(i=0,k1=0;i<n;i++)
            {
                 if(judge(s[i])==1)
                 {
                    k1=1;
                    break;
                 }
            }
            for(i=0,k2=1;i<n-2;i++)
            {
                  if(judge(s[i])==1&&judge(s[i+1])==1&&judge(s[i+2])==1||judge(s[i])==0&&judge(s[i+1])==0&&judge(s[i+2])==0)
                  {
                       k2=0;
                       break;
                  }
            }
            for(i=0,k3=1;i<n-1;i++)
            {
                   if(s[i]==s[i+1]&&(s[i]!='e'||s[i+1]!='e')&&(s[i]!='o'||s[i+1]!='o'))
                   {
                        k3=0;
                        break;
                   }
            }
            if(k1==1&&k2==1&&k3==1)
            printf("<%s> is acceptable.\n",s);
            else
            printf("<%s> is not acceptable.\n",s);
    }
    return 0;
}