Accepted solution

118A - String Task.

Open original problem
Source code

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<stack>

#include<queue>

#include<iterator>

#include<algorithm>

/* ==================================================

  |                                                  |

  |    Author: *** S. M. Sabiul Hajjaj Sabit ***     |

  |       Last Edit:  May,14,2019                    |

   ================================================== */

///***global declaration***///

#define all(arr) arr.begin(),arr.end()

#define pb push_back

#define lb lower_bound

#define up upper_bound

#define sz(x) x.size()

#define min3(a,b,c)  min(min(a,b),c)

#define max3(a,b,c)  max(max(a,b),c)

using namespace std;

int i,j,n,m,sum=0,ans=0;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

        pow *= a;

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    string str,ans;

    cin>>str;

    for(int i=0; i<sz(str); i++)

    {

        if(str[i]!='a'  && str[i]!='A' && str[i]!='e' && str[i]!='E' && str[i]!='i'  && str[i]!='I' & str[i]!='o'  && str[i]!='O' && str[i]!='u'  && str[i]!='U' &&  str[i]!='y'  && str[i]!='Y')

        {

            ans +='.';

            if(str[i]>='A' && str[i]<='Z')str[i]+=32;

            ans +=str[i];

        }

    }

    cout<<ans<<endl;

}
Join the discussion

Add your comment