acm试训题

题目链接：https://vjudge.net/problem/CodeForces-118A
题目分析：灵活利用ascll码和if语句，注意字符串后面是以’\0’结尾的
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
#include “pch.h”
#include
using namespace std;
int main()
{
char*p = new char[101];
cin >> p;
for (int i = 0; p[i] != ‘\0’; i++)
{
int k = 1;
if (p[i] >= 65 && p[i] <= 90)p[i] += 32;
if (p[i] == ‘Y’ || p[i] == ‘y’ || p[i] == ‘A’ || p[i] == ‘a’ || p[i] == ‘i’ || p[i] == ‘I’
|| p[i] == ‘O’ || p[i] == ‘o’ || p[i] == ‘E’ || p[i] == ‘e’ || p[i] == ‘U’ || p[i] == ‘u’)
k = 0;
if(k)
cout << “.” << p[i];
}
delete[]p;
}