Problem——118A. String Task——Codeforces

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

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
#define maxn 2147483648+30
using namespace std;
ll gar(ll a,ll b){//最大公约数 
return b==0?a:gar(b,a%b);
}
int main(){
	string s;
	while(cin>>s){
		ll len=s.length();
		for(int i=0,j=0;i<len;i++){
			if(s[i]>='A'&&s[i]<='Z'){
				s[i]+=32;
			}
			if(s[i]=='a'||s[i]=='o'||s[i]=='e'||s[i]=='i'||s[i]=='y'||s[i]=='u'){
				s[i]=' ';
			}
		}
		for(int i=0;i<len;i++){
			if(s[i]==' ')continue;
			else cout<<"."<<s[i];
		}
		cout<<endl;
	}
	return 0;
}