CodeForces-118A

CodeForces-118A

             CodeForces-118A 

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.

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

这道题不算很难，不过要调整好操作的顺序。我就先把字母都转换成小写字母先，这样就不用考略大写元音字母了。另外，不必把所有要输出的内容都存储起来，例如“。“这个符号，可以把元音字母除掉后，再输出辅音字母的同时，输出”。“

#include <iostream>

#include<cstring>

using namespace std;
 
int main()
{   char a[120],b[100];

    cin>> a;
    int i, d;
    for (i = 0; a[i] != '\0'; i++)
    if(a[i] >= 'A'&&a[i] <='Z')

            a[i] += 32;
    for (i = 0; a[i] != '\0'; i++)

    {
         if (a[i] == 'a' || a[i] == 'e' || a[i] == 'i' || a[i] == 'o' || a[i] == 'u' || a[i] == 'y' )
         {
            for (int j = 0; j < i;j++)
                  b[j]= a[j];
             for (int j = i; a[j]!='\0'; j++)
                  b[j]= a[j + 1];
            for (int j = 0; j <strlen(a); j++)
                  a[j]= b[j], d = j;
                 a[d + 1] = '\0';
                          i--;
         }

    }   

    for (i = 0; a[i] != '\0'; i++)
      cout << "." << a[i];
    return 0;
}}