-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathE.cpp
70 lines (64 loc) · 1022 Bytes
/
E.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
68
69
70
//#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;
cin>>n;
vector<string > v(n);
fab(0,n,i)
{
cin>>v[i];
}
string ans="YES";
fab(0,n-1,i)
{
fab(0,n-1,j)
{
if(i==0)
{
if(v[i][j]=='1')
{
if(v[i][j+1]=='0' and v[i+1][j]=='0')
{
ans="NO";
break;
}
}
}
else
{
if(v[i][j]=='1')
{
if(v[i][j+1]=='0' and v[i+1][j]=='0')
{
ans="NO";
break;
}
}
}
}
}
cout<<ans<<endl;
}
return 0;
}