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

    题目链接: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): 10919    Accepted Submission(s): 5270


    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
     

    Recommend
    We have carefully selected several similar problems for you:  1062 1073 1043 1088 1113 
     
    题目大意:这个题目主要是对字符串进行处理。详细有三个要求:1、至少存在一个元音 2、不能出现连续两个同样的字母。除了oo和ee 3、不能出现三个连续的元音,也不能出现三个连续的辅音。


    详见代码。

    #include<iostream>
    #include<cstring>
    #include<cstdio>
    
    using namespace std;
    
    int num[30]={0};
    
    int main()
    {
        num['a'-'a']=1;
        num['e'-'a']=1;
        num['i'-'a']=1;
        num['o'-'a']=1;
        num['u'-'a']=1;
        char str[5000];
        while(~scanf("%s",&str),strcmp(str,"end")!=0)
        {
            int s=0;
            int flag=0;
            int len=strlen(str);
            for(int i=0;i<len;i++)
            {
                if(num[str[i]-'a']==1)
                    s++;
                if(i>0)
                if(str[i]!='o'&&str[i]!='e'&&str[i]==str[i-1])
                    flag=1;
                if(i>1)
                if(num[str[i]-'a']==num[str[i-1]-'a']&&num[str[i]-'a']==num[str[i-2]-'a'])
                    flag=1;
            }
            if(s==0)flag=1;
            if(flag==0)
            printf("<%s> is acceptable.
    ",str);
            else
                printf("<%s> is not acceptable.
    ",str);
        }
        return 0;
    }

  • 相关阅读:
    mybatis xml中是sql语句报错: Error creating document instance. Cause: org.xml.sax.SAXParseException: The
    先排序,后取前xx条数据
    SQL判断字段是否为空,为NULL,且连续两个字段降序排列(oracle)
    double数据保留两位
    ajax在echart代码中的正确使用
    List集合去重排序
    如何把项目中的lib下的jar包,本机上的jar包导入项目中引用
    MongoVue如何执行JS文件
    三维叠加标签代码
    beatfullsoup
  • 原文地址:https://www.cnblogs.com/yfceshi/p/7039460.html
Copyright © 2011-2022 走看看