Codeforces (118A) Problem Solution

A. String Task

Problem Link : [Codeforces 118A##link##]
Solution:

• [tab]
• C++

• #include<bits/stdc++.h>
  using namespace std;
  int main()
  {
      string s;
      cin>>s;
      queue<char> q;
      for(int i=0;i<s.length();++i)
      {
          char a=tolower(s[i]);
          if(a != 'a' && a !='e' && a !='i' && a!='o' && a!='u' && a!='y' )
          {
              q.push(a);
          }
      }
      while(!q.empty())
      {
          cout<<"."<<q.front();
          q.pop();
      }
      return 0;
  }

• Python 3

• vowel = ['a','o','y','e','u','i']
  s = ''
  string = str(input())
  k = string.lower()
  for a in range(len(string)):
      if k[a] not in vowel:
          s+='.'
          s+=k[a]
   
  print(s)

• JAVA

• //java 11
  import java.util.*;
  public class srrcomputation {
   
  	public static void main(String[] args) {
  		 
  		    Scanner sc = new Scanner(System.in);
  		    String  s = sc.next();
  		    char a[] = s.toCharArray(); 
  		    String p = "";
  		    for(int i = 0 ; i<a.length;i++)
  		    {
  		    	 if(a[i]<97)
  		    	 {    
  		    		 a[i] = (char)(a[i]+ 'a'-'A');
  		    	 }   
  		    	 if(a[i]=='a'||a[i]=='e'||a[i]=='i'||a[i]=='o'||a[i]=='u'||a[i]=='y')
  		    	      ;
  		    	      else
  		    	  p = p + "." + a[i];
  		    	    
  		    }
  		    System.out.print(p);
  		  }
  		
   
  	}