String Task
题面翻译
给出一个长度为 n n n 的单词,写出一个程序,执行以下操作:
- 删除单词里的元音字母。
- 辅音字母前加上字符
.
。 - 所有大写字母全部转化为小写字母。
注:元音字母有 A,O,Y,E,U,I \text{A,O,Y,E,U,I} A,O,Y,E,U,I,其余的全部都是辅音字母。
输入仅一行,为一个单词(仅包含大小写字母)。
输出仅一行,代表经程序处理后的单词。
数据范围: 1 ⩽ n ⩽ 100 1\leqslant n\leqslant 100 1⩽n⩽100。
题目描述
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.
输入格式
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.
输出格式
Print the resulting string. It is guaranteed that this string is not empty.
样例 #1
样例输入 #1
tour
样例输出 #1
.t.r
样例 #2
样例输入 #2
Codeforces
样例输出 #2
.c.d.f.r.c.s
样例 #3
样例输入 #3
aBAcAba
样例输出 #3
.b.c.b
代码内容
// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//队列
// #include <queue>//堆/优先队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器,存数组的数,表数组的长度
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin>>s;
for(auto &t:s)
{
if(isupper(t)) t+=32;
}
for(auto &t :s)
{
if(t=='a'||t=='o'||t=='y'||t=='e'||t=='u'||t=='i')
continue;
cout<<"."<<t;
}
return 0;
}