Posts

Showing posts with the label Codechef

Solution of 'Weird Palindrome Making' (Codechef November Challenge 2021 Div3)

Hey guys! Here's my solution to the problem 'Weird Palindrome Making' from Codechef November Challenge 2021 Div3. Comment any suggestions if you have. #include <bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second #define pii pair < int,int > using namespace std ; int32_t main () {     int t ;     cin >> t ;     while ( t --){         int n ;         cin >> n ;         vector < int > odd ;         for ( int i = 0 ; i < n ; i ++){             int x ;             cin >> x ;             if ( x % 2 != 0 ) odd . push_back ( x );         }         int s = odd . size ();         cout << s / 2 << ' \n ' ;     }   ...

Solution of 'Equal Coins' (Codechef November Challenge 2021 Div 3)

Hola guys!! Here's my solution to the problem- 'Equal Coins' from Codechef November Challenge 2021 Div3. If you have any suggestions do comment. Happy Coding!! This question mainly tests your maths  skills. Question Link: https://www.codechef.com/NOV21C/problems/EQUALCOIN #include <bits/stdc++.h> #define int long long #define pb push_back #define fi first #define se second #define pii pair < int,int > using namespace std ; int32_t main () {     int t ;     cin >> t ;     while ( t --){         int x , y ;         cin >> x >> y ;         int sum = x + y * 2 ;         if ( sum != 0 ){             if ( x != 0 && sum % 2 == 0 ) cout << "YES" << ' \n ' ; // like 4 3             else if ( x == 0 && y % 2 == 0 ) cout << "YES" << ...

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 ){                ...

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 ' ;      ...