问题
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.
Example
Input:
tour
Output:
.t.r
Input:
Codeforces
Output:
.c.d.f.r.c.s
Input:
aBAcAba
Output:
.b.c.b
问题理解
处理一个只含有大小写字母的字符串,删除字符串中的所有元音(a,e,i,o,u,y);在辅音字母前添加“.”;把所有大写字母换成小写字母。
思路
用一个字符型数组str1接收字符串,用另一个将字符型数组str2记录填充。把str1中的大写字母变成小写字母,同时判断元素是否是元音字母,如果是元音字母则不处理;否则在str2里填充’.’ , ‘元素’。处理完后输出str2。
代码
#include<iostream>
using namespace std;
#define N 101
int main()
{
char str1[N], str2[201];
int i,j,len;
gets_s(str1);
len=strlen(str1);
for (i =j= 0; i < len; i++)
{
if (str1[i] >= 'A'&&str1[i] <= 'Z')//小写化
{
str1[i] += 32;
}
switch (str1[i])//删除元音和在辅音前加'.'
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
case 'y':break;
default:str2[j] = '.'; str2[++j] = str1[i]; j++;
}
str2[j] = '\0';
}
puts(str2);
return 0;
}