zoukankan      html  css  js  c++  java
  • HDU 1039 Easier Done Than Said?

    Easier Done Than Said?

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


    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.
    Source
    分析:

    判读条件

    1:有元音字母

    2:不能三个连续元音或辅音

    3.不能连续两个相同的字母,除非ee或oo

    下面给出AC代码:

    复制代码
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 int main()
     4 {
     5     char str[25];
     6     int a[25];
     7     while(scanf("%s",str)&&strcmp("end",str))
     8     {
     9         int len=strlen(str);
    10         int flag=1;
    11         int sum=0;//sum 标记元音的个数
    12         for(int i=0;i<len;i++)
    13         {
    14             switch(str[i])
    15             {
    16                 case 'a':
    17                 case 'e':
    18                 case 'i':
    19                 case 'o':
    20                 case 'u':a[i]=1;sum++;break;
    21                 default :a[i]=0;
    22             }
    23             if(i>0&&str[i]==str[i-1]&&str[i]!='e'&&str[i]!='o')//2个连续的相同音,排除e/o
    24             {
    25                 flag=0;
    26                 break;
    27             }
    28             if(i>1&&a[i]==a[i-1]&&a[i-1]==a[i-2])// 连续三个相连的元音或辅音   注意 i满足的条件,
    29             {
    30                 flag=0;
    31                 break;
    32             }
    33         }
    34         if(sum&&flag)
    35             printf("<%s> is acceptable.
    ",str);
    36         else printf("<%s> is not acceptable.
    ",str);
    37     }
    38     return 0;
    39 }
    复制代码
  • 相关阅读:
    FJNU 1151 Fat Brother And Geometry(胖哥与几何)
    FJNU 1157 Fat Brother’s ruozhi magic(胖哥的弱智术)
    FJNU 1159 Fat Brother’s new way(胖哥的新姿势)
    HDU 3549 Flow Problem(最大流)
    HDU 1005 Number Sequence(数列)
    Tickets(基础DP)
    免费馅饼(基础DP)
    Super Jumping! Jumping! Jumping!(基础DP)
    Ignatius and the Princess IV(基础DP)
    Keywords Search(AC自动机)
  • 原文地址:https://www.cnblogs.com/yechanglv/p/6941951.html
Copyright © 2011-2022 走看看