Solution of 'Face the Direction' (Codechef)

Hi guys! It's been a while. I am back with my solution of the question - ' Face the Direction' from Codechef Starters 11. Any suggestion for me is highly appreciated. Happy Coding!


Question link: https://www.codechef.com/START11C/problems/FACEDIR


#include <bits/stdc++.h>
#define int long long int

using namespace std;

int32_t main()
{
    int t,x;
    cin>>t;
    while(t--){
        cin>>x;
        if(x%4==0) cout<<"NORTH"<<'\n';
        else if((x-1)%4==0) cout<<"EAST"<<'\n';
        else if((x-2)%4==0) cout<<"SOUTH"<<'\n';
        else if((x-3)%4==0) cout<<"WEST"<<'\n';
    }
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Solution of 'The Two Dishes' (Codechef)

Hey everyone! Here's my solution to the problem- 'The Two Dishes' from Codechef Starters 11. If you have any suggestions, feel free to comment :) Happy Coding! Question link: https://www.codechef.com/START11C/problems/MAX_DIFF #include   <bits/stdc++.h> #define   int  long long int using   namespace   std ; int32_t   main () {      int   t ;      cin >> t ;      while ( t --){          int   n , s , M = 0 ;          cin >> n >> s ;          for ( int   t1 = 0 ; t1 <= n ; t1 ++){              if ( s - t1 <= n && s - t1 >= 0 && abs ( 2 * t1 - s )> M ){                  M = abs ( 2 * t1 - s );}         }          cout << M << ' \n ' ;     }      return   0 ; }
Read more

Solution of 'Tom Riddle's Diary' (Codeforces)

  Hey everyone! Here's my solution of the question- Tom Riddle's Diary from Codeforces. If you guys have any suggestion do comment. T.Y. and Happy coding. question link: https://codeforces.com/contest/855/problem/A #include   <bits/stdc++.h> using   namespace   std ;   int   main () {      vector < string > v ;      int   n ;      cin >> n ;      string   a [ n ];      for ( int   i = 0 ; i < n ; i ++){          string   p ;          cin >> p ;          v . push_back ( p );          int   h = count ( v . begin (),  v . end (), p );          if ( h == 1 )  a [ i ] = "NO" ;          else   a [ i ] = "YES" ;     }      for ( int   j = 0 ; j < n ; j ++)  cout << a [ j ] << ' \n ' ;      return   0 ; }
Read more

Solution of 'Less or Equal' (Codeforces)

  Hey guys! Here's my solution of question-'Less or Equal' from Codeforces. I am looking forward to your suggestions for my code or blog. So do comment. TY and Happy coding! question link: https://codeforces.com/contest/977/problem/C #include   <bits/stdc++.h> #define   pair   < int,int >  pp using   namespace   std ; int   main () {      int   n , k ;      cin >> n >> k ;      vector < int >  vec ;      for ( int   i = 0 ; i < n ; i ++){          int   x ;          cin >> x ;          vec . push_back ( x );     }      sort ( vec . begin (), vec . end ());      if (( k != 0 )&&( vec [ k - 1 ] != vec [ k ] )) { cout << vec [ k - 1 ] ;}      else   if (( k == 0 )&& vec [ k ] != 1 ){ cout << vec [ k ] - 1 ;}      else {          cout << - 1 ;     } }
Read more