CF 89 div2 A
思路:water
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include <cstdlib> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <iostream> #define MAXN 100000 using namespace std; char s[12]={'a','o','y','e','u','i','A','O','Y','E','U','I'}; bool is_ok(char c) { for(int i=0;i<12;i++) if(c==s[i]) return true; return false; } int main() { string s; cin>>s; for(int i=0;i<s.size();i++) { if(!is_ok(s[i])) { cout<<"."; if(s[i]>='A'&&s[i]<='Z') cout<<char(s[i]-('A'-'a')); else cout<<s[i]; } } cout<<endl; return 0; }