-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathG.cpp
67 lines (60 loc) · 957 Bytes
/
G.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
int main()
{ quick;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--)
{
int n,m,a,b;
cin>>n>>m>>a>>b;
if(a*n!=m*b)
{
cout<<"NO\n";
continue;
}
cout<<"YES\n";
int shift;
fab(1,m,i)
{
if(i*n%m==0)
{
shift=i;
break;
}
}
int inc=0;
vector< vector<int> > ans(n,vector<int> (m,0));
fab(0,n,i)
{
fab(0,a,j)
ans[i][(j+inc)%m]=1;
inc+=shift;
}
fab(0,n,i)
{
fab(0,m,j)
{
cout<<ans[i][j];
}
cout<<endl;
}
}
return 0;
}