Codeforces 1333A - Little Artem Solution

  ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    #include <bits/stdc++.h>

    using namespace std;

    int main()

    {

        int t,n,m,i,j;

        cin>>t;

        while(t--)

        {

            cin>>n>>m;

            for(i=0; i<n; i++)

            {

                for(j=0; j<m; j++)

                {

                    if(i==0&&j==0)

                        cout<<"W";

                    else

                        cout<<"B";

                }

                cout<<endl;

            }

        }

    }



    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.