-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path118A | String Task.cpp
More file actions
55 lines (47 loc) · 1 KB
/
Copy path118A | String Task.cpp
File metadata and controls
55 lines (47 loc) · 1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include "bits/stdc++.h"
#include "iostream"
#include "vector"
#include "map"
#include "unordered_map"
#include "utility"
#include "algorithm"
#include "math.h"
#include "iterator"
using namespace std;
#define nline "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define PI 3.141592653589793238462
#define fastio() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> p;
typedef vector< pair<int, int> > v_p;
void solve()
{
string s, t;
cin >> s;
transform(s.begin(), s.end(), s.begin(), :: tolower);
for(int i=0; i<s.size(); i++)
{
if(s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u' || s[i] == 'y')
{
continue;
}
else
{
t += '.';
t += s[i];
}
}
cout << t << nline;
}
int main()
{
fastio();
solve();
return 0;
}