1333A - Little Artem - CodeForces Solution

constructive algorithms *1000

Please click on ads to support us..

Python Code: 

import sys
input = sys.stdin.readline

t = int(input())
ans = []
for _ in range(t):
    n, m = map(int, input().split())
    a = []
    if (n * m) % 2:
        for i in range(n):
            a0 = []
            for j in range(m):
                if (i + j) % 2:
                    a0.append("W")
                else:
                    a0.append("B")
            a.append(a0)
    else:
        for i in range(n):
            a0 = []
            for j in range(m):
                if (i + j) % 2:
                    a0.append("B")
                else:
                    a0.append("W")
            a.append(a0)
        a[0][0] = "B"
    for a0 in a:
        ans.append("".join(a0))
sys.stdout.writelines("\n".join(ans))

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        int array[n][m];
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                if(i==0 && j==0) cout<<"W";
                else cout<<"B";
            }
            cout<<endl;
        }
    }
}


Comments

Submit
0 Comments
More Questions

750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee