zoukankan      html  css  js  c++  java
  • A. String Task

    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
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 using namespace std;
     5 
     6 int main(){
     7     char a[105];
     8     int i,length;
     9     scanf("%s",a);
    10     length=strlen(a);
    11     for(int i=0;i<length;i++)
    12         if(a[i]=='a'||a[i]=='A'||a[i]=='e'||a[i]=='E'||a[i]=='i'||a[i]=='I'||a[i]=='o'||a[i]=='O'||a[i]=='u'||a[i]=='U'||a[i]=='y'||a[i]=='Y')
    13     continue;
    14     else {
    15         if(a[i]>='A'&&a[i]<='Z')
    16             a[i]=a[i]+32;
    17             printf(".%c",a[i]);
    18     }
    19     printf("
    ");
    20     return 0;
    21 }
  • 相关阅读:
    性能优化之_android多线程
    bootstrap搜索样式
    bootstrap模态框通过传值解决重复提交问题
    web请求乱码问题总结
    jsp页面自动换行
    cron表达式
    js中简单操作
    文件上传(前端)
    viz.js操作流程
    graphviz.js划线操作
  • 原文地址:https://www.cnblogs.com/z-712/p/7307506.html
Copyright © 2011-2022 走看看