Solution to the problem 'A' from 'Hello 2022' Contest (Codeforces)

Here's my solution to problem  A from the contest 'Hello 2022' of Codeforces. 

#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()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    cin>>t;
    while(t--){
        int n,k,m=0;
        cin>>n>>k;
        if(n%2==0){
            if(k<=n/2){
                for(int i=1;i<=n;i++){
                    for(int j=1;j<=n;j++){
                        if(k>0 && i==2*m+1&&j==2*m+1){
                            cout<<'R';
                            k--;
                            m++;
                        }
                        else cout<<'.';
                    }
                    cout<<'\n';
                }
            }
            else cout<<-1<<'\n';
        }
        else{
            if(k<=(n/2)+1){
                for(int i=1;i<=n;i++){
                    for(int j=1;j<=n;j++){
                        if(k>0 && i==2*m+1&&j==2*m+1){
                            cout<<'R';
                            k--;
                            m++;
                        }
                        else cout<<'.';
                    }
                    cout<<'\n';
                }
            }
            else cout<<-1<<'\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