Codeforces Round #804 (Div. 2) 1699B - Almost Ternary Matrix Solution
Problem Link: https://codeforces.com/problemset/problem/1699/B
Solution in C++:
///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t,n,m,i,j;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(i=1; i<=n/2; i++)
        {
            for(j=1; j<=m/2; j++)
            {
                if(i%2==j%2)cout<<"0 1 ";
                else cout<<"1 0 ";
            }
            cout<<endl;
            for(j=1; j<=m/2; j++)
            {
                if(i%2!=j%2)cout<<"0 1 ";
                else cout<<"1 0 ";
            }
              cout<<endl;
        }
    }
}
 

 

No comments