String Task_Codeforces_118A

53 阅读 0 评论 35 点赞

我是靠谱客的博主温婉小刺猬，最近开发中收集的这篇文章主要介绍String Task_Codeforces_118A，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

原题链接：http://codeforces.com/problemset/problem/118/A

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

思路：建立两个数组，然后遍历第一个数组，遇见元音则跳过，否则添加"."再添加该字母（也可以边读边存，但是储存输出字符串的数组要开大一些，因为输入可能没有元音）

#include<cstdio>
#include<cstring>
#include<cctype>

using namespace std;

int main()
{
    char s1[110] = {0};
    char s2[250] = {0};
    scanf("%s", s1);
    for(int i = 0, j = 0; i < strlen(s1); i++)
    {
        if(isalpha(s1[i]))
            s1[i] = tolower(s1[i]);
        if(s1[i] == 'a' || s1[i] == 'e' || s1[i] == 'i' || s1[i] == 'o' || s1[i] == 'u' || s1[i] == 'y')
            continue;
        else
        {
            s2[j++] = '.';
            s2[j++] = s1[i];
        }
    }
    printf("%s", s2);
    return 0;
}