String Task

迷南。 2022-08-01 13:49 117阅读 0赞

B - String Task

**Time Limit:**2000MS     **Memory Limit:**262144KB     **64bit IO Format:**%I64d & %I64u

Submit   [Status][]   [Practice][]   [CodeForces 118A][]

Description

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.

Sample Input

Input

tour

Output

.t.r

Input

Codeforces

Output

.c.d.f.r.c.s

Input

aBAcAba

Output

.b.c.b

**这一题虽然简单但是我却犯了一个非常重要的错误就是我用C++的指针删除字符，（当删除一个字符时指针自动移到下一位，这一点我没有看到）下次注意了！**

#include<cstdio>
    #include<iostream>
    #include<cstring>
    using namespace std;
    int main()
    {
        string s,s1;
        int i,stl;
        while(cin>>s)
        {
            s1.clear();
           // cout<<s<<endl;
            for(string::iterator i=s.begin();i!=s.end();i++)
            {
                if(isalpha(*i))
                {
                    *i=tolower(*i);
                }
                if(*i=='o'||*i=='a'||*i=='u'||*i=='e'||*i=='i'||*i=='y')
                {
                    s.erase(i);
                    i--;
                }
            }
          //  cout<<s<<endl;
            stl=s.length();
            for(int j=0;j<stl;j++)
            {
                s1.push_back('.');
                s1.push_back(s[j]);
            }
            cout<<s1<<endl;
        }
    }

[Status]: http://acm.hust.edu.cn/vjudge/contest/view.action?cid=66033#status//B/0
[Practice]: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=24454
[CodeForces 118A]: http://acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=24454