1360G - AB Matrix - CodeForces Solution

#include<bits/stdc++.h>
#define int long long
#define double long double
#define PB push_back
#define maxn 100007
#define bit(x,i) ((x>>i)&1)
#define S second
#define F first
#define MP make_pair
#define epsilon 0.000001

using namespace std;

typedef pair<int,int> pii;
typedef pair<double,double> pdd;
const int inf = 1e18;
const int mod = 1e9+7;

int add(int x, int y){
    int s=x+y;
    if (s>mod) s-=mod;
    return s;
}

int n,m,a,b;

void readData(){
    cin>>n>>m>>a>>b;
}

void solve(){
    if (n*a!=b*m){
        cout<<"NO"<<"\n";
        return;
    }
    cout<<"YES"<<"\n";
    int d=0;
    for (int i=1;i<m;i++)
        if ((i*n)%m==0){
            d=i;
            break;
        }
    int ans[n+1][m+1];
    for (int i=0;i<n;i++)
        for (int j=0;j<m;j++)
            ans[i][j]=0;
    int dak=0;
    for (int i=0;i<n;i++){
        dak+=d;
        for (int j=0;j<a;j++)
            ans[i][(j+dak)%m]=1;
    }
    for (int i=0;i<n;i++){
        for (int j=0;j<m;j++)
            cout<<ans[i][j];
        cout<<"\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //freopen(".inp","r",stdin);
    //freopen(".out","w",stdout);
    int t;
    cin>>t;
    while (t--){
        readData();
        solve();
    }
    return 0;
}
/*
               _oo0oo_
              o8888888o
              88" . "88
              (| -_- |)
              0\  =  /0
            ___/`---'\___
          .' \\|     |// '.
         / \\|||  :  |||// \
        / _||||| -:- |||||- \
       |   | \\\  -  /// |   |
       | \_|  ''\---/''  |_/ |
       \  .-\__  '-'  ___/-. /
     ___'. .'  /--.--\  `. .'___
  ."" '<  `.___\_<|>_/___.' >' "".
 | | :  `- \`.;`\ _ /`;.`/ - ` : | |
 \  \ `_.   \_ __\ /__ _/   .-` /  /
=====`-.____`.___ \_____/___.-`___.-'=====
               `=---='
*/