A. String Task

A. String Task

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
问题链接：A. String Task.

问题简述：

输入一串字符，挑出其中的非元音字符小写输出。输出时每个字符前加“.”。

问题分析：

利用ASCII码，可以精准的挑出非元音字符并换成小写输出。

程序说明：

本程序使用ASCII码，精准挑出字符。但是，打程序的时间会很长，特别是记不了ASCII码的情况下。有待改进。

AC通过的C语言程序如下：

     #include "stdafx.h"
     #include<iostream>
    using namespace std;
        
    int main()
    {
    	char a[101];
    	cin >> a;
    	int i = 0;
    	while (a[i] != 0)
    	{
    		if (a[i] == 65 || a[i] == 79 || a[i] == 89 || a[i] == 69 || a[i] == 85 || a[i] == 73 ||
    			a[i] == 65 + 32 || a[i] == 79 + 32 || a[i] == 89 + 32 || a[i] == 69 + 32 || a[i] == 85 + 32 || a[i] == 73 + 32)
    		{
    			i++;
    			continue;
    		}
    		if (a[i] >= 65 && a[i] <= 90) cout << "." << char(a[i] + 32);
    		else cout << "." << a[i];
    		i++;
    	}
    	return 0;
    }