zoukankan      html  css  js  c++  java
  • B

    Problem description

    Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it:

    • deletes all the vowels,
    • inserts a character "." before each consonant,
    • replaces all uppercase consonants with corresponding lowercase ones.

    Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program's input is exactly one string, it should return the output as a single string, resulting after the program's processing the initial string.

    Help Petya cope with this easy task.

    Input

    The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from 1 to 100, inclusive.

    Output

    Print the resulting string. It is guaranteed that this string is not empty.

    Examples

    Input

    tour

    Output

    .t.r

    Input

    Codeforces

    Output

    .c.d.f.r.c.s

    Input

    aBAcAba

    Output

    .b.c.b
    解题思路:题目比较简单。要求删除给定字符串中出现的6个元音字母,输出的时候在每个辅音字母前面加一个字符'.',并且输出全部为小写。这里边判断边输出,水过。
    AC代码:
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const char obj[6]={'a','e','i','o','u','y'};
     4 bool is_letter(char ch){
     5     for(int i=0;i<6;++i)
     6         if(ch==obj[i])return true;
     7     return false;
     8 }
     9 int main()
    10 {
    11     char str[105];
    12     cin>>str;
    13     for(int i=0;str[i]!='';++i){
    14         if(str[i]>='A'&&str[i]<='Z')str[i]+=32;
    15         if(!is_letter(str[i]))printf(".%c",str[i]);
    16     }
    17     cout<<endl;
    18     return 0;
    19 }
     
  • 相关阅读:
    代理模式(Proxy)
    桥接模式(Bridge)
    组合模式(Composite)
    装饰器模式(Decorator)
    外观模式(Facade)
    享元模式(FlyWeight)
    职责链模式(Chain of Responsibility)
    迭代器模式(Iterator)
    中介者模式(Mediator)
    命令模式(Command)
  • 原文地址:https://www.cnblogs.com/acgoto/p/9103189.html
Copyright © 2011-2022 走看看