text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
const long long N = 2e5 + 1;
using namespace std;
long long n, m, x, y, k, cnt, ans;
vector<long long> v, v1;
long long a[51][51];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> a[i][j];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] > 1) {
bool f = false;
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
if (a[i][j] == a[i][x] + a[y][j]) f = 1;
}
}
if (f == false) {
cout << "No";
return 0;
}
}
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l;
int n;
cin >> n;
int arr[n][n];
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) cin >> arr[i][j];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (arr[i][j] == 1) continue;
int flag = 0;
for (k = 0; k < n; k++) {
for (l = 0; l < n; l++) {
if (arr[i][l] + arr[k][j] == arr[i][j]) flag = 1;
}
}
if (!flag) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m, a[N][N];
vector<long long> v1, v2;
cin >> n;
m = n;
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) cin >> a[i][j];
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= m; j++) {
if (a[i][j] == 1) continue;
v1.clear();
v2.clear();
long long r = i, c = j;
for (long long k = 1; k <= m; k++) {
if (k == c) continue;
v1.push_back(a[r][k]);
}
for (long long k = 1; k <= n; k++) {
if (k == r) continue;
v2.push_back(a[k][c]);
}
long long sum = 0;
bool f = 0;
for (long long x = 0; x < v1.size(); x++) {
for (long long y = 0; y < v2.size(); y++) {
sum = v1[x] + v2[y];
if (sum == a[i][j]) {
f = 1;
break;
}
}
if (f) break;
}
if (f == 0) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> a[i][j];
}
int f = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] != 1) {
int c = 0;
for (int p = 0; p < n; p++) {
for (int q = 0; q < n; q++) {
if (a[i][j] == a[p][j] + a[i][q]) {
c = 1;
continue;
}
}
}
if (!c) {
f = 1;
break;
}
}
}
}
if (!f)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
const int N = 50;
int n;
cin >> n;
int a[N][N] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
if (a[x][y] == 1) continue;
bool f = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[x][y] == a[x][i] + a[j][y]) {
f = true;
break;
}
}
if (f) break;
}
if (!f) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int n, a[N][N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
scanf("%d", &a[i][j]);
}
}
bool isOk = true;
for (int i = 1; i <= n && isOk; ++i) {
for (int j = 1; j <= n && isOk; ++j) {
if (a[i][j] == 1) {
continue;
}
bool flag = false;
for (int s = 1; s <= n && !flag; ++s) {
for (int t = 1; t <= n && !flag; ++t) {
if (a[i][j] == a[i][s] + a[t][j]) {
flag = true;
}
}
}
if (!flag) {
isOk = false;
}
}
}
puts(isOk ? "Yes" : "No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int arr[x][x];
for (int i = 0; i < x; i++) {
for (int j = 0; j < x; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < x; i++) {
for (int j = 0; j < x; j++) {
if (arr[i][j] == 1) continue;
bool check = false;
for (int a = 0; a < x; a++) {
if (a == j) continue;
for (int b = 0; b < x; b++) {
if (b == i) continue;
int total = arr[i][a] + arr[b][j];
if (total == arr[i][j]) {
check = true;
break;
}
}
if (check) {
break;
}
}
if (!check) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, i, j, l, o, m[55][55];
int main() {
cin >> n;
while (i < n) {
while (j < n) {
cin >> m[i][j];
j++;
}
i++;
j = 0;
}
i = 0;
while (i < n) {
while (j < n) {
while (l < n) {
while (o < n) {
if (m[i][o] + m[l][j] == m[i][j]) c++;
o++;
}
l++;
o = 0;
}
if (c == 0 && m[i][j] != 1) return cout << "No", 0;
j++;
l = 0;
c = 0;
}
i++;
j = 0;
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[1005][1005];
int vis[1005][1005];
int main() {
scanf("%d", &n);
memset(a, 0, sizeof(a));
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%d", &a[i][j]);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int flag = 0;
if (a[i][j] == 1) continue;
for (int k = 0; k < n; k++) {
if (flag == 1) break;
for (int l = 0; l < n; l++) {
if (k != j && l != i && (a[i][k] + a[l][j] == a[i][j])) {
vis[i][j] = 1;
flag = 1;
break;
}
}
}
if (vis[i][j] == 0) {
puts("No");
return 0;
}
}
puts("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int a[N][N];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
if (a[x][y] != 1) {
bool test = false;
for (int s = 0; s < n; s++) {
for (int t = 0; t < n; t++) {
if (s == y || t == x) continue;
test |= (a[x][y] == a[x][s] + a[t][y]);
}
}
if (!test) return cout << "NO\n", 0;
}
}
}
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int f2, f, t, k, l, j, i, n, a[100][100];
f = 1;
cin >> n;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) cin >> a[i][j];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] > 1) {
f2 = 0;
for (k = 0; k < n; k++) {
if (i == k) continue;
for (l = 0; l < n; l++) {
if (l == j) continue;
if (a[i][l] == a[i][j] - a[k][j]) {
f2 = 1;
break;
}
}
}
if (!f2) {
f = 0;
break;
}
}
if (!f) break;
}
if (!f) break;
}
if (f)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, mid, ans1, n, ans, l, r, a[100][100];
bool f;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> a[i][j];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] != 1) {
f = false;
for (int l = 1; l <= n; l++) {
for (int r = 1; r <= n; r++) {
if (r == i || l == j) continue;
if (a[r][j] + a[i][l] == a[i][j]) f = true;
}
}
if (f == false) return cout << "No", 0;
}
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 50 + 10;
int n, lab[maxN][maxN], f, flag;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> lab[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (lab[i][j] != 1) {
for (int ii = 0; ii < n; ii++) {
for (int jj = 0; jj < n; jj++) {
if (lab[i][jj] + lab[ii][j] == lab[i][j]) f++;
}
}
} else
f++;
if (!f) flag++;
f = 0;
}
}
if (!flag)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[1010][1010], i, j, tt, ii, jj;
bool b, bb;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
b = 1;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
bb = 0;
if (a[i][j] == 1) bb = 1;
for (ii = 1; ii <= n; ii++) {
if (i != ii) {
for (jj = 1; jj <= n; jj++) {
if (j != jj) {
if (a[i][j] != 1) {
if (a[i][j] == a[i][jj] + a[ii][j]) {
bb = 1;
}
}
}
}
}
}
if (bb == 0) b = 0;
}
}
if (b)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include <bits/stdc++.h>
int matrix[50][50];
int main() {
int n;
scanf("%d", &n);
bool finished = false;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%d", &matrix[i][j]);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (matrix[i][j] == 1) continue;
finished = false;
for (int k = 0; !finished && k < n; k++) {
if (k == i) continue;
for (int l = 0; !finished && l < n; l++) {
if (l == j) continue;
if (matrix[k][j] + matrix[i][l] == matrix[i][j]) {
finished = true;
break;
}
}
}
if (!finished) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e8;
int mp[100][100];
int main(void) {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> mp[i][j];
}
}
int res = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int flag = 0;
if (mp[i][j] == 1) continue;
for (int p = 1; p <= n; p++) {
if (p == i) continue;
for (int q = 1; q <= n; q++) {
if (q == j) continue;
if (mp[p][j] + mp[i][q] == mp[i][j]) {
flag = 1;
}
}
}
if (!flag) res = 1;
}
}
if (!res)
puts("Yes");
else
puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<pair<long long int, long long int>, long long int> a,
pair<pair<long long int, long long int>, long long int> b) {
return a.second > b.second;
}
bool check(vector<vector<long long int> > s, int x, int y) {
int n = s.size();
for (long long int j = 0; j < n; j++) {
for (long long int k = 0; k < n; k++) {
if (s[x][j] + s[k][y] == s[x][y]) {
return true;
}
}
}
return false;
}
bool func(vector<vector<long long int> > s,
vector<pair<pair<long long int, long long int>, long long int> > v) {
long long int n = s.size();
for (long long int i = 0; i < v.size(); i++) {
if (v[i].second != 1) {
long long int x = v[i].first.first;
long long int y = v[i].first.second;
if (!check(s, x, y)) {
return false;
}
}
}
return true;
}
int main() {
long long int n;
cin >> n;
vector<vector<long long int> > s;
vector<pair<pair<long long int, long long int>, long long int> > v;
for (long long int i = 0; i < n; i++) {
vector<long long int> v1;
for (long long int j = 0; j < n; j++) {
long long int p;
cin >> p;
v1.push_back(p);
v.push_back({{i, j}, p});
}
s.push_back(v1);
}
sort(v.begin(), v.end(), cmp);
if (func(s, v))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ar[55][55];
int main(void) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &ar[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (ar[i][j] != 1) {
bool check = false;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (ar[i][k] + ar[l][j] == ar[i][j]) check = true;
}
}
if (check == false) {
printf("No\n");
return 0;
}
}
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int p[MAXN][MAXN];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) scanf("%d", &p[i][j]);
bool isGood = true;
bool judge;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (p[i][j] != 1) {
judge = false;
for (int k = 0; k < n; ++k)
for (int l = 0; l < n; ++l)
if (p[i][j] == p[i][k] + p[l][j]) judge = true;
if (!judge) isGood = false;
}
if (isGood)
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> ar;
bool f;
int main() {
cin >> n;
ar.resize(n);
for (int i = 0; i < n; ++i) {
ar[i].resize(n);
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> ar[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (ar[i][j] == 1) {
continue;
}
f = false;
for (int i1 = 0; i1 < n; ++i1) {
for (int j1 = 0; j1 < n; ++j1) {
if (ar[i][j] == ar[i][j1] + ar[i1][j]) {
f = true;
}
}
}
if (!f) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[55][55];
int n;
bool panduan(int p, int q) {
int num = a[p][q], sum = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i != p && j != q) {
if (a[i][q] + a[p][j] == num) return true;
}
return false;
}
int main() {
while (cin >> n) {
int flog = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> a[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
if (a[i][j] != 1) {
if (!panduan(i, j)) {
flog = 1;
break;
}
}
if (flog) break;
}
if (flog)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int mat[n][n];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) cin >> mat[i][j];
}
int i, j, t, k, fg = 0;
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
fg = 0;
if (mat[i][j] != 1) {
for (k = 0; k < n; ++k) {
if (k == i) continue;
for (t = 0; t < n; ++t) {
if (t == j) continue;
if (mat[i][t] + mat[k][j] == mat[i][j]) {
fg = 1;
break;
}
}
if (fg) break;
}
if (!fg) {
cout << "NO\n";
return 0;
}
}
}
}
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
const long long max9 = 10 + 1e9, max6 = 10 + 1e6, max12 = 10 + 1e12,
max15 = 10 + 1e15;
const long long min6 = -1 * max6, min9 = -1 * max9, min12 = -1 * max12,
min15 = -1 * max15;
const long long R = 7 + 1e9, NN = 10 + 1e5;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n][n];
for (int i = (0); i < (n); ++i)
for (int j = (0); j < (n); ++j) cin >> a[i][j];
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (n); ++j) {
bool A = false;
if (a[i][j] == 1)
continue;
else {
for (int c = (0); c < (n); ++c) {
if (c == i) continue;
for (int r = (0); r < (n); ++r) {
if (r == j) continue;
if (a[i][r] + a[c][j] == a[i][j]) {
A = true;
break;
}
}
if (A) break;
}
if (!A) {
cout << "NO";
return 0;
}
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<set<int> > st(60);
int a[55][55];
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
st[j].insert(a[i][j]);
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j] == 1) continue;
bool f = 0;
for (int x = 0; x < n; ++x) {
if (a[i][x] < a[i][j] && st[j].count(a[i][j] - a[i][x])) f = 1;
}
if (!f) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, flag;
cin >> n;
int a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] != 1) {
flag = 0;
for (int p = 0; p < n; p++) {
for (int q = 0; q < n; q++) {
if (a[i][j] == a[i][p] + a[q][j]) {
flag = 1;
}
}
}
if (flag == 0) {
cout << "NO";
exit(0);
}
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 1e17;
const long long mod = 1e9 + 7;
long long modInverse(long long a, long long m) {
long long m0 = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m;
long long t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
long long powm(long long a, long long b) {
a = a % mod;
long long res = 1;
while (b) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return (res % mod);
}
const long long N = 2e5 + 6;
void solve() {
int n;
cin >> n;
int arr[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> arr[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (arr[i][j] != 1) {
bool bo = false;
for (int k = 0; k < n; k++)
for (int l = 0; l < n; l++)
if (arr[i][k] + arr[l][j] == arr[i][j]) {
bo = true;
break;
}
if (!bo) {
cout << "No\n";
return;
}
}
}
}
cout << "Yes\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t = 1;
for (long long i = 1; i <= t; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
const int MAXINT = 2147483640;
const long long MAXLL = 9223372036854775800LL;
const long long MAXN = 1000000;
const double pi = 3.1415926535897932384626433832795;
using namespace std;
long long x1[300][300];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
srand(time(0));
long long n, i, j, i1, j1, h, m;
cin >> n;
m = n;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) cin >> x1[i][j];
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
if (x1[i][j] != 1) {
h = 0;
for (i1 = 1; i1 <= n; i1++)
for (j1 = 1; j1 <= m; j1++)
if (i1 != i and j1 != j)
if (x1[i1][j] + x1[i][j1] == x1[i][j]) h++;
if (!h) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9;
const long long INF64 = 1e15;
const double EPS = 1e-8;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<vector<long long>> a(n, vector<long long>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] != 1) {
bool solve = false;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
solve |= (a[i][j] == a[k][j] + a[i][l]);
}
}
if (!solve) {
cout << "No";
return 0;
}
}
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int ar[50][50];
int n;
int check(int r, int c) {
int v = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (ar[r][i] + ar[j][c] == ar[r][c]) {
return 1;
}
}
}
return 0;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> ar[i][j];
}
int flag = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (ar[i][j] != 1) {
flag = flag && check(i, j);
}
if (!flag) {
break;
}
}
if (!flag) {
break;
}
}
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, a[50][50] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] != 1) {
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (a[i][j] == a[i][k] + a[l][j]) {
k = n;
}
}
if (k == n - 1) {
cout << "No";
return 0;
}
}
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[50][50];
cin >> n;
bool x[50][50];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) x[i][j] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> h[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (h[i][j] != 1) {
for (int l = 0; l < n; l++) {
for (int b = 0; b < n; b++) {
if (h[l][j] + h[i][b] == h[i][j]) x[i][j] = 1;
}
}
} else
x[i][j] = 1;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (x[i][j] == 0) return cout << "No", 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long t[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> t[i][j];
bool f = false, ff = false;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
if (t[i][j] == 1) continue;
f = false;
for (int k = 0; k < n; k++)
for (int l = 0; l < n; l++)
if (j != k || i != l) {
if (t[i][k] + t[l][j] == t[i][j]) {
k = n;
l = n;
f = true;
}
}
if (!f) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[55][55];
int main() {
int n;
scanf("%d", &n);
for (int i = int(0); i <= int(n - 1); i++) {
for (int j = int(0); j <= int(n - 1); j++) {
scanf("%d", &a[i][j]);
}
}
bool ans = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] > 1) {
bool ch = false;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (a[i][k] + a[l][j] == a[i][j]) {
ch = true;
}
}
}
if (ch == false) {
ans = false;
}
}
}
}
if (ans) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using std::map;
using std::max;
using std::min;
using std::set;
using std::sort;
using std::swap;
using std::vector;
inline int readInt() {
int ans = 0;
char c;
do c = getchar();
while (!isdigit(c));
while (isdigit(c)) {
ans = ans * 10 + c - '0';
c = getchar();
}
return ans;
}
const int N = 55;
int A[N][N];
int main() {
int n = readInt();
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) A[i][j] = readInt();
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (A[i][j] != 1) {
bool ok = false;
for (int k = 0; k < n; ++k)
if (i != k) {
for (int l = 0; l < n; ++l)
if (j != l && A[i][j] == A[k][j] + A[i][l]) {
ok = true;
break;
}
if (ok) break;
}
if (!ok) return puts("NO"), 0;
}
return puts("YES"), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, mat[60][60];
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> mat[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (mat[i][j] == 1) continue;
bool ok = false;
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
if (mat[i][x] + mat[y][j] == mat[i][j]) {
ok = true;
break;
}
}
if (ok) break;
}
if (!ok) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[55][55];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) cin >> A[i][j];
int cont = 0, Y = 0, C = 0;
for (int i = 0; i < N; i++) {
int S = 0;
for (int j = 0; j < N; j++) {
if (A[i][j] != 1) {
Y = 0;
cont++;
for (int x = i - 1; x >= 0; x--) {
for (int y = j - 1; y >= 0; y--) {
if (A[i][j] == A[i][y] + A[x][j]) {
Y++;
}
}
}
for (int x = i + 1; x < N; x++) {
for (int y = j - 1; y >= 0; y--) {
if (A[i][j] == A[i][y] + A[x][j]) {
Y++;
}
}
}
for (int x = i - 1; x >= 0; x--) {
for (int y = j + 1; y < N; y++) {
if (A[i][j] == A[i][y] + A[x][j]) {
Y++;
}
}
}
for (int x = i + 1; x < N; x++) {
for (int y = j + 1; y < N; y++) {
if (A[i][j] == A[i][y] + A[x][j]) {
Y++;
}
}
}
if (Y) C++;
}
}
}
if (C == cont)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:36777216")
const int Inf = 2e9;
long long LINF = (long long)4e18;
using namespace std;
long long mod = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<vector<int>> vc(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> vc[i][j];
}
}
char flg = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (vc[i][j] != 1) {
for (int l = 0; l < n; l++) {
for (int r = 0; r < n; r++) {
if (vc[i][l] + vc[r][j] == vc[i][j]) {
flg = 1;
break;
}
}
if (flg == 1) {
break;
}
}
if (flg != 1) {
cout << "No";
return 0;
}
flg = 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long m[55][55];
int main() {
long long n;
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> m[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
bool found = false;
for (int k = 0; k < n; ++k) {
for (int p = 0; p < n; ++p) {
if ((m[i][j] == m[i][p] + m[k][j]) || m[i][j] == 1) found = true;
}
}
if (!found) {
cout << "No" << '\n';
return 0;
}
}
}
cout << "Yes" << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[55][55];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &v[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int z = v[i][j];
if (z == 1) continue;
int ok = 0;
for (int k = 0; k < n && !ok; k++) {
if (k == i) continue;
int x = v[k][j];
for (int l = 0; l < n && !ok; l++) {
if (l == j) continue;
int y = v[i][l];
if (x + y == z) ok = 1;
}
}
if (!ok) {
printf("No\n");
return 0;
}
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int arr[n][n];
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) scanf("%d", &arr[i][j]);
}
int k, l, counter = 0, final_counter = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (arr[i][j] != 1) {
for (k = 0; k < n; k++) {
for (l = 0; l < n; l++) {
if (arr[i][k] + arr[l][j] == arr[i][j]) {
counter = 1;
break;
}
}
if (counter == 1) break;
}
if (counter == 0) {
final_counter = 1;
}
}
if (final_counter == 1) break;
counter = 0;
}
if (final_counter == 1) break;
}
if (final_counter == 1)
printf("No\n");
else
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void printArr(int a[], int l, int r) {
for (int i = l; i <= r; i++) {
cout << a[i] << " ";
}
cout << endl;
}
void printMtx(int a[][1010], int n, int m) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
int a[60][60], n;
bool check(int r, int c) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if ((i != c) && (j != r)) {
if (a[r][i] + a[j][c] == a[r][c]) return true;
}
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] != 1) {
if (!(check(i, j))) {
cout << "No\n";
return 0;
}
}
}
}
cout << "Yes\n";
}
|
#include <bits/stdc++.h>
int a[50][50];
int main() {
int n, i, j, k, l;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) scanf("%d", &a[i][j]);
}
int flag = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] == 1) continue;
int ele = a[i][j];
int flag2 = 0;
for (k = 0; k < n; k++) {
if (k == j) continue;
int n1 = a[i][k];
for (l = 0; l < n; l++) {
if (l == i) continue;
if (a[l][j] + n1 == ele) {
flag2 = 1;
break;
}
}
}
if (!flag2) {
flag = 0;
break;
}
}
if (!flag) break;
}
if (flag)
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[60][60];
int mat(int row, int col) {
if (a[row][col] == 1) return 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][col] + a[row][j] == a[row][col] && i != row && j != col)
return 1;
}
}
return 0;
}
int main() {
int p;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (mat(i, j) == 0) {
printf("No");
return 0;
}
}
}
printf("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[60][60], cnt;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int(i) = (0); (i) < (n); (i++))
for (int(j) = (0); (j) < (n); (j++)) cin >> a[i][j];
for (int(i) = (0); (i) < (n); (i++))
for (int(j) = (0); (j) < (n); (j++)) {
if (a[i][j] != 1) {
int second = 0;
for (int k = 0; !second and k < n; k++) {
for (int l = 0; !second and l < n; l++)
if (a[i][j] == a[i][k] + a[l][j]) second = 1;
}
cnt += second;
} else
cnt++;
}
if (cnt == n * n)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, count1 = 0, count2 = 0, k, yes = 0, l;
cin >> n;
int num[n][n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
cin >> num[i][j];
if (num[i][j] != 1) count1++;
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (num[i][j] > 1) {
yes = 0;
for (k = 0; k < n; k++) {
for (l = 0; l < n; l++) {
if (num[i][j] == num[i][k] + num[l][j]) {
yes++;
break;
}
}
if (yes == 1) break;
}
if (yes == 1) count2++;
}
}
}
if (n == 1) {
if (num[0][0] > 1)
cout << "No";
else
cout << "Yes";
} else if (count1 == count2) {
cout << "Yes";
} else if (count1 != count2 || count1 == 0) {
cout << "No";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int ar[51][51];
int main() {
cin >> n;
m = n;
int t = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> ar[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (ar[i][j] != 1) {
int y = 0;
for (int ii = 1; ii <= n; ii++)
for (int jj = 1; jj <= m; jj++)
if (ii != i && jj != j)
if (ar[ii][j] + ar[i][jj] == ar[i][j]) y = 1;
t = min(t, y);
}
}
}
if (t)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:108777216")
using namespace std;
int const MAX_N = 256;
int s[MAX_N][MAX_N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%d", &s[i][j]);
int t = 1;
for (int i = 0; i < n && t; i++)
for (int j = 0; j < n && t; j++)
if (s[i][j] != 1) {
int Ok = 0;
for (int a = 0; a < n && !Ok; a++)
for (int b = 0; b < n && !Ok; b++)
if (s[a][j] + s[i][b] == s[i][j]) Ok = 1;
if (!Ok) {
t = 0;
break;
}
}
if (t)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[55][55], n, flag = 0;
int check(int i, int j) {
for (int x = 1; x <= n; x++)
for (int y = 1; y <= n; y++)
if (x != j && y != i && a[i][x] + a[y][j] == a[i][j]) return 1;
return -1;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++) {
if (flag == 1) break;
for (int j = 1; j <= n; j++) {
if (a[i][j] > 1) {
if (check(i, j) == -1) {
flag = 1;
break;
}
}
}
}
if (flag == 1)
printf("No\n");
else
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1005][1005];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) scanf("%d", &a[i][j]);
}
bool flag = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1) continue;
bool mark = false;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (a[i][j] == a[i][k] + a[l][j]) {
mark = true;
break;
}
}
if (mark) break;
}
if (!mark) {
flag = false;
break;
}
}
if (!flag) break;
}
if (flag)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long i, n, q, a[1000005], b, p[1000005], z, j, k, k1, s[60][60];
map<long long, long long> mp, mp1;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) cin >> s[i][j];
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
z = 0;
if (s[i][j] != 1) {
for (k = 0; k < n; k++) {
for (k1 = 0; k1 < n; k1++) {
if (s[i][k1] + s[k][j] == s[i][j] && k1 != j && k != i) {
z = 1;
}
}
}
if (z == 0) {
cout << "No";
return 0;
}
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> vec;
int main() {
int n;
cin >> n;
vec.clear();
vec.resize(n, vector<int>(n));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> vec[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (vec[i][j] == 1) continue;
bool flag = false;
for (int ii = 0; ii < n; ++ii) {
for (int jj = 0; jj < n; ++jj) {
if (vec[ii][j] + vec[i][jj] == vec[i][j]) {
flag = true;
break;
}
}
}
if (!flag) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
int g[55][55];
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) scanf("%d", &g[i][j]);
}
int success = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (g[i][j] != 1) {
int flag = 0;
for (int l = 0; l < n; l++) {
if (l == i) continue;
for (int k = 0; k < n; k++) {
if (k == j) continue;
if (g[i][j] == g[l][j] + g[i][k]) {
flag = 1;
break;
}
}
if (flag) break;
}
if (flag == 0) {
success = 0;
break;
}
}
if (success == 0) break;
}
}
if (success == 0)
printf("No\n");
else
printf("Yes\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int arr[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> arr[i][j];
}
}
int done, raise_ecp = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (arr[i][j] != 1) {
done = 0;
for (int s = 0; s < n; s++) {
for (int t = 0; t < n; t++) {
if (arr[i][j] == arr[i][s] + arr[t][j]) {
done = 1;
}
}
}
if (done == 0) {
raise_ecp = 1;
}
}
}
}
if (raise_ecp == 1) {
printf("No\n");
} else {
printf("Yes\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int arr[N][N];
set<int> col[N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> arr[i][j];
col[j].insert(arr[i][j]);
}
}
int flag = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (arr[i][j] != 1) {
int flag1 = 1;
for (int k = 0; k < N; k++) {
if (col[j].find(arr[i][j] - arr[i][k]) != col[j].end()) {
flag1 = 0;
break;
}
}
flag = flag | flag1;
}
}
}
if (!flag) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int arr[x][x];
for (int i = 0; i < x; i++) {
for (int j = 0; j < x; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < x; i++) {
for (int j = 0; j < x; j++) {
if (arr[i][j] == 1) continue;
bool check = false;
for (int a = 0; a < x; a++) {
if (a == i) continue;
for (int b = 0; b < x; b++) {
if (b == j) continue;
int total = arr[i][b] + arr[a][j];
if (total == arr[i][j]) {
check = true;
break;
}
}
if (check) {
break;
}
}
if (!check) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long ool = 1e18 + 9;
const int oo = 1e9 + 9, base = 1e9 + 7;
const double eps = 1e-7;
const int N = 111;
int n, a[N][N];
int main() {
ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
cin >> a[i][j];
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[i][j] == 1) continue;
bool ok = 0;
for (int k = 1; k <= n; ++k) {
for (int k2 = 1; k2 <= n; ++k2) {
if (a[i][j] == a[i][k] + a[k2][j]) ok = 1;
}
}
if (!ok) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[50][50];
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> a[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
bool mark = false;
for (int x = 0; x < n; x++)
for (int y = 0; y < n; y++) {
if (a[i][j] == a[i][x] + a[y][j]) mark = true;
}
if (!mark && a[i][j] != 1) return cout << "No", 0;
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int grid[50][50];
for (int i = 0; i < (n); ++i) {
for (int j = 0; j < (n); ++j) {
cin >> grid[i][j];
}
}
for (int i = 0; i < (n); ++i) {
for (int j = 0; j < (n); ++j) {
if (grid[i][j] == 1) continue;
bool pass = false;
for (int r = 0; r < n; r++) {
if (r == i) continue;
for (int c = 0; c < n; c++) {
if (c == j) continue;
int sum = grid[r][j] + grid[i][c];
if (sum == grid[i][j]) {
pass = true;
break;
}
}
if (pass) break;
}
if (!pass) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][n];
bool isPerfect = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> arr[i][j];
}
}
if (n == 1) {
if (arr[0][0] == 1) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
isPerfect = false;
for (int k = 0; k < n; k++) {
if (k == j) {
continue;
}
for (int l = 0; l < n; l++) {
if (l == i) {
continue;
}
if (arr[i][j] != 1) {
if (arr[i][k] + arr[l][j] == arr[i][j]) {
isPerfect = true;
break;
}
} else {
if (arr[i][k] == arr[i][j] || arr[l][j] == arr[i][j]) {
isPerfect = true;
break;
}
}
}
}
if (!isPerfect) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[55][55];
int n, m;
bool check(int x, int y) {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (a[x][j] + a[i][y] == a[x][y]) return 1;
}
return 0;
}
int main() {
cin >> n;
m = n;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (a[i][j] != 1 && check(i, j) == 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mat[200][200];
int n, flag;
void solve() {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (mat[i][j] != 1) {
flag = 0;
for (int s = 0; s < n; s++) {
if (s == j) {
continue;
}
for (int t = 0; t < n; t++) {
if (t == i) {
continue;
}
if (mat[i][j] == mat[i][s] + mat[t][j]) {
flag = 1;
t = n;
s = n;
}
}
}
if (flag == 0) {
return;
}
} else {
flag = 1;
}
}
}
return;
}
int main() {
cin >> n;
flag = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> mat[i][j];
}
}
solve();
if (flag == 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[50][50];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> a[i][j];
}
int check = 1;
for (int i = 0; i < n && check; i++) {
for (int j = 0; j < n && check; j++) {
if (a[i][j] != 1) {
int flag = 0;
for (int k = 0; k < n && !flag; k++) {
for (int l = 0; l < n && !flag; l++) {
if (a[i][j] == a[i][k] + a[l][j]) flag = 1;
}
}
if (!flag) check = 0;
}
}
}
if (check)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[101][101];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> arr[i][j];
}
vector<int> v, vv;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int num = arr[i][j];
if (num == 1) continue;
for (int k = 0; k < n; k++) {
if (arr[i][k] == num)
continue;
else
v.push_back(arr[i][k]);
}
for (int k = 0; k < n; k++) {
if (arr[k][j] == num)
continue;
else
vv.push_back(arr[k][j]);
}
sort(vv.begin(), vv.end());
sort(v.begin(), v.end());
bool fff = 0;
int zz;
for (zz = 0; zz < v.size(); zz++) {
if (binary_search(vv.begin(), vv.end(), num - v[zz])) {
fff = 1;
break;
}
}
if (zz == n - 1 & fff == 0) {
cout << "No\n";
return 0;
}
vv.clear();
v.clear();
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
static const double EPS = 1e-9;
int main() {
int n;
scanf("%d", &n);
int a[n * n];
for (int i = 0; i < n * n; i++) {
scanf("%d", &a[i]);
}
int ok = 1;
for (int i = 0; i < n * n; i++) {
if (a[i] == 1) continue;
ok = 0;
for (int j = 0; j < n * n; j++) {
if (i % n == j % n) {
int temp = a[i] - a[j];
for (int k = 0; k < n * n; k++) {
if (i / n == k / n && temp - a[k] == 0) {
ok = 1;
break;
}
}
}
if (ok == 1) break;
}
if (ok == 0) {
printf("No");
return 0;
}
}
if (ok == 1)
printf("Yes");
else
printf("No");
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[55][55];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
scanf("%d", &a[i][j]);
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
if (a[i][j] == 1) continue;
int fl = 0;
for (int s = 1; s <= n; ++s)
for (int t = 1; t <= n; ++t) {
if (a[i][j] == a[i][s] + a[t][j]) fl = 1;
}
if (fl == 0) {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> arr[i][j];
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (arr[i][j] == 1) {
continue;
}
int flag = 0;
for (int k = 0; k < n; k++) {
if (k == i) continue;
for (int l = 0; l < n; l++) {
if (l == j) continue;
sum = arr[i][l] + arr[k][j];
if (sum == arr[i][j]) {
flag = 1;
break;
}
}
if (flag == 1) break;
}
if (flag == 0) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[55][55];
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
if (a[i][j] != 1) {
cnt++;
}
}
}
bool flag = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] != 1) {
flag = false;
for (int y = 0; y < n; y++) {
int num = a[i][j] - a[i][y];
for (int h = 0; h < n; h++) {
if (a[h][j] == num) {
flag = true;
cnt--;
break;
}
}
if (flag) break;
}
}
}
}
if (cnt == 0)
cout << "Yes";
else
cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[51][51];
bool flag;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][j] != 1) {
flag = 0;
for (int k = 1; k <= n; k++)
for (int p = 1; p <= n; p++)
if (k != j && p != i)
if (a[i][k] + a[p][j] == a[i][j]) flag = 1;
if (flag == 0) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[101][101];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] == 1) continue;
bool flag = false;
for (int k = 1; k <= n; k++)
for (int l = 1; l <= n; l++)
if (a[i][j] == a[i][k] + a[l][j]) flag = true;
if (!flag) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
const int maxn = 250;
bool cmp(int i, int j) { return i > j; }
int main() {
int a[maxn][maxn], b[maxn][maxn], n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> a[i][j];
for (int ki = 0; ki < n; ki++) {
for (int kj = 0; kj < n; kj++) {
if (a[ki][kj] == 1) continue;
int num;
bool pass = false;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[ki][kj] == a[ki][j] + a[i][kj]) pass = true;
}
}
if (!pass) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int arr[51][51];
bool checkSum(int num, int row, int col) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (arr[row][i] + (long long int)arr[j][col] == num) {
return true;
}
}
}
return false;
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
scanf("%d", &arr[i][j]);
}
}
bool flag = true;
for (int i = 0; i < N && flag; i++) {
for (int j = 0; j < N && flag; j++) {
if (arr[i][j] != 1) {
flag = checkSum(arr[i][j], i, j);
}
}
}
if (flag) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e18;
int n, a[100][100], b;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
if (n == 1) {
int x;
cin >> x;
if (x == 1)
return cout << "Yes" << '\n', 0;
else
return cout << "No" << '\n', 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1) continue;
for (int k = 0; k < n; k++) {
if (k == i) continue;
for (int k1 = 0; k1 < n; k1++) {
if (k1 == j) continue;
if (a[i][j] == a[k][j] + a[i][k1]) {
b = 1;
break;
}
}
if (b) break;
}
if (!b) {
cout << "No" << '\n';
return 0;
}
b = 0;
}
}
cout << "Yes" << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-4;
const int mod = 1e9 + 7;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int maxn = 1e2 + 7;
const int maxm = 1e6 + 7;
const double pi = acos(-1.0);
int n;
int a[maxn][maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] == 1) continue;
bool flag = false;
for (int ii = 1; ii <= n; ii++)
for (int jj = 1; jj <= n; jj++) {
if (a[i][j] == a[i][jj] + a[ii][j]) flag = true;
}
if (!flag) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int maze[55][55];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
scanf("%d", &maze[i][j]);
}
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (maze[i][j] != 1) {
bool flag = false;
for (int k = 1; k <= n && !flag; ++k)
for (int t = 1; t <= n && !flag; t++)
flag = maze[i][j] == maze[i][k] + maze[t][j];
if (!flag) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, arr[100][100], l, m, n, x, coun, sum, ans, T, check;
char str[100];
vector<long long> v;
string s;
cin >> n;
long long xx[] = {1, 0, -1, 0};
long long zz[] = {0, -1, 0, 1};
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) cin >> arr[i][j];
check = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
x = arr[i][j];
if (x == 1) continue;
for (k = 0; k < n; k++) {
if (k == i) continue;
for (l = 0; l < n; l++) {
if (l == j) continue;
if (x == arr[i][l] + arr[k][j]) {
check = 1;
break;
}
check = 0;
}
if (check == 1) break;
}
if (check == 0) {
cout << "NO" << endl;
return 0;
}
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ara[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> ara[i][j];
}
}
int ok = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int x = ara[i][j];
if (x == 1) continue;
bool flag = false;
for (int p = 0; p < n; p++) {
for (int q = 0; q < n; q++) {
if (!(p == j || q == i) && ara[i][p] + ara[q][j] == x) {
flag = true;
}
}
}
ok = ok && flag;
}
}
if (ok)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
if (n == 1) return false;
if (n == 2) return true;
for (long long i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
long long poww(long long b, long long e) {
if (e == 0)
return 1;
else if (e % 2 == 0) {
long long a = pow(b, e / 2);
return a * a;
} else {
long long a = pow(b, e / 2);
return b * a * a;
}
}
long long powm(long long x, long long y, long long m = 1000000007) {
x = x % m;
long long res = 1;
while (y) {
if (y & 1) res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
long long modInverse(long long a, long long m = 1000000007) {
return powm(a, m - 2, m);
}
void print(vector<long long> v) {
for (long long i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
}
void print(long long arr[]) {
long long size = *(&arr + 1) - arr;
for (long long i = 0; i < size; i++) {
cout << arr[i] << " ";
}
}
string to_bin(long long n) {
string res = "";
long long i = 0;
while (n > 0) {
if (n % 2 == 1) {
res = res + '1';
} else {
res = res + '0';
}
n /= 2;
i++;
}
reverse(res.begin(), res.end());
return res;
}
long long to_dec(string second) {
long long n = second.size(), ans = 0, temp = 1;
for (long long i = n - 1; i >= 0; i--) {
long long x = second[i] - '0';
ans += x * temp;
temp *= 2;
}
return ans;
}
void result(bool first) {
if (first)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void solve() {
long long n;
cin >> n;
long long mat[n + 1][n + 1];
for (long long i = 1; i < n + 1; i++) {
for (long long j = 1; j < n + 1; j++) {
cin >> mat[i][j];
}
}
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) {
long long x = mat[i][j];
if (x == 1) continue;
bool first = 0;
for (long long l = 1; l <= n; l++) {
for (long long u = 1; u <= n; u++) {
if (mat[i][u] + mat[l][j] == x) {
first = 1;
}
}
}
if (!first) {
cout << "No" << endl;
return;
}
}
}
cout << "Yes" << endl;
}
int32_t main() {
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100005, mod = 1e9 + 7;
const long double pie = 3.14159265358979323846264338327950288419716939937510;
long long n, a[55][55];
bool v = 1;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (long long i = 1; i <= n; ++i) {
for (long long j = 1; j <= n; ++j) {
cin >> a[i][j];
}
}
for (long long i = 1; i <= n; ++i) {
for (long long j = 1; j <= n; ++j) {
if (a[i][j] > 1) {
bool v1 = 0;
for (long long k = 1; k <= n; ++k) {
for (long long m = 1; m <= n; ++m) {
if (k != i && m != j) {
if (a[i][m] + a[k][j] == a[i][j]) {
v1 = 1;
}
}
}
}
if (v1 == 0) v = 0;
}
}
}
if (v)
cout << "Yes";
else
cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn(55);
int a[maxn][maxn];
int main() {
int n, i, j, k, l;
while (~scanf("%d", &n)) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", a[i] + j);
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] == 1) continue;
for (k = 0; k < n; k++) {
for (l = 0; l < n; l++) {
if (a[i][j] == a[i][k] + a[l][j]) break;
}
if (l < n) break;
}
if (k >= n) break;
}
if (j < n) break;
}
puts(i >= n ? "Yes" : "No");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int a[51][51];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) cin >> a[i][j];
bool good = true;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j] != 1) {
bool thisok = false;
for (int k = 0; k < n; ++k) {
for (int p = 0; p < n; ++p) {
thisok |= a[i][k] + a[p][j] == a[i][j];
}
}
good &= thisok;
}
}
}
cout << (good ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
static int a[50][50];
cin >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) cin >> a[i][j];
bool ok = 1;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
if (a[i][j] == 1) continue;
bool ok2 = 0;
for (int k = 0; k < n; ++k)
for (int l = 0; l < n; ++l)
if (a[i][k] + a[l][j] == a[i][j]) ok2 = 1;
if (!ok2) ok = 0;
}
cout << (ok ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int lab[55][55];
bool good = true;
bool check(int i, int j, int val) {
for (int k = 1; k <= n; k++)
if (k != i)
for (int p = 1; p <= n; p++)
if (p != j)
if (lab[k][j] + lab[i][p] == val) return true;
return false;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> lab[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (lab[i][j] != 1) {
good = good and check(i, j, lab[i][j]);
}
if (good == false) {
break;
}
}
if (!good) {
break;
}
}
cout << (good ? "Yes" : "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int maxx(int fd, int sd) { return (fd > sd) ? fd : sd; }
int minn(int fd, int sd) { return (fd < sd) ? fd : sd; }
long long gcd(long long a, long long b) {
if (a == 0) return b;
if (b == 0) return a;
if (a < b)
return gcd(b % a, a);
else
return gcd(a % b, b);
}
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> a(n);
for (int i = 0; i < n; ++i) {
a[i].resize(n);
for (int j = 0; j < n; ++j) {
scanf("%d", &a[i][j]);
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j] == 1) continue;
bool b = false;
for (int k = 0; k < n; ++k) {
for (int l = 0; l < n; ++l) {
if (a[i][k] + a[l][j] == a[i][j]) {
b = true;
break;
}
}
if (b) break;
}
if (!b) {
printf("No");
return 0;
}
}
}
printf("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void SO() { cout << endl; }
template <typename S, typename... Strings>
void SO(S x, const Strings&... rest) {
cout << x << ' ';
SO(rest...);
}
template <typename T>
void trace(const char* name, T&& arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
trace(comma + 1, args...);
}
const long double PI = 3.1415926535897932384626433832795;
const int v5 = 100000;
const int v9 = 1000000000;
const int v6 = 1000000;
inline long long int ABS(long long int a) {
if (a < 0) return (-a);
return a;
}
inline long long int min(long long int a, long long int b, long long int c) {
return min(a, min(b, c));
}
inline long long int max(long long int a, long long int b, long long int c) {
return max(a, max(b, c));
}
inline void AI(long long int x[], long long int n) {
for (int i = 0; i < (n); ++i) cin >> (x[i]);
}
inline void VI(vector<long long int>& arr, long long int n) {
for (int i = 0; i < (n); ++i) {
long long int x;
cin >> (x);
arr.push_back(x);
};
}
const int AS = 4000001;
long long int n, m, k, c = 0;
long long int a[101][101];
map<long long int, vector<long long int> > g;
map<long long int, long long int> hsh[100], hsh2[100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> (n);
for (long int i = (0); i < (n); ++i)
for (long int j = (0); j < (n); ++j) {
cin >> (a[i][j]);
hsh[i][a[i][j]] = 1;
}
for (long int i = (0); i < (n); ++i)
for (long int j = (0); j < (n); ++j)
if (a[i][j] != 1) {
long long int c = 0;
for (long int k = (0); k < (n); ++k)
if (hsh[i].find(a[i][j] - a[k][j]) != hsh[i].end()) {
c++;
break;
}
if (c == 0) {
SO("No");
return 0;
}
}
{
SO("Yes");
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[55][55];
void solve() {
bool ans = 1;
for (int x = 1; x <= n; ++x) {
for (int y = 1; y <= n; ++y) {
if (a[x][y] == 1) continue;
bool flag = 0;
for (int s = 1; s <= n; ++s) {
for (int t = 1; t <= n; ++t) {
if (a[x][s] + a[t][y] == a[x][y]) {
flag = 1;
break;
}
}
}
if (!flag) ans = 0;
}
}
printf("%s\n", ans ? "YES" : "NO");
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
scanf("%d", &a[i][j]);
}
}
solve();
}
|
#include <bits/stdc++.h>
int a[55][55], n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%d", &a[i][j]);
bool isGood = true;
for (int i = 0; i < n && isGood; i++)
for (int j = 0; j < n && isGood; j++) {
if (a[i][j] == 1) continue;
bool flag = false;
for (int x = 0; x < n && !flag; x++)
for (int y = 0; y < n && !flag; y++)
if (a[i][j] == a[i][y] + a[x][j] && x != i && y != j) flag = true;
if (!flag) isGood = false;
}
printf("%s", isGood ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m = 0, k = 1, e, mo = 0, x, y = 0, d, i, l = -8909, j = -987,
na = 0, p = 0, o = 0, t = 0, z = 0, c1 = 12341, c2 = -2;
cin >> n;
long long int a[n][n], b[n][n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
cin >> a[i][j];
b[i][j] = a[i][j];
}
}
p = 0;
z = 0;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] != 1) {
z = 0;
for (k = 0; k < n; k++) {
for (l = 0; l < n; l++) {
if (k == j || l == i) continue;
if (a[i][k] + a[l][j] == a[i][j]) {
z = 1;
break;
}
}
if (z == 1) break;
}
if (z != 1) {
cout << "No";
return 0;
}
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
int n;
int mat[51][51];
int main() {
scanf("%d", &n);
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) scanf("%d", &mat[i][j]);
int fl = 0;
for (i = 0; i < n && fl == 0; i++)
for (j = 0; j < n && fl == 0; j++) {
if (mat[i][j] == 1) continue;
int ii, jj, fla = 0;
for (ii = 0; ii < n; ii++)
for (jj = 0; jj < n; jj++)
if (mat[i][ii] + mat[jj][j] == mat[i][j]) fla = 1;
if (!fla) fl = 1;
}
if (fl)
printf("No\n");
else
printf("Yes\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[51][51], i, j, flag = 1;
cin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) cin >> a[i][j];
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
flag = 1;
if (a[i][j] == 1) continue;
int s, t;
for (s = 1; s <= n; s++)
for (t = 1; t <= n; t++)
if (a[i][s] + a[t][j] == a[i][j]) flag = 0;
if (flag == 1) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[55][55], flag[55][55] = {0};
bool ac() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] > 1 && !flag[i][j]) {
return false;
}
}
}
return true;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf(" %d", &a[i][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int p = 1; p <= n; p++) {
for (int q = 1; q <= n; q++) {
if ((i != p) || (j != q)) {
if (!flag[i][q] && (a[i][q] == a[i][j] + a[p][q])) {
flag[i][q] = 1;
}
if (!flag[p][j] && (a[p][j] == a[i][j] + a[p][q])) {
flag[p][j] = 1;
}
}
}
}
}
}
bool ans = ac();
printf(ans ? "Yes\n" : "No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long prime = 1e9 + 7;
int main() {
int n;
bool flag = false;
cin >> n;
long long a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
flag = false;
if (a[i][j] != 1) {
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (a[i][l] + a[k][j] == a[i][j]) {
flag = true;
break;
}
}
if (flag) {
break;
}
}
if (!flag) {
cout << "No";
return 0;
}
}
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int a[n][n];
bool cig[n][n], yes = true;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
if (a[i][j] == 1) {
cig[i][j] = true;
} else {
cig[i][j] = false;
}
}
}
for (int i1 = 0; i1 < n; ++i1) {
for (int j1 = 0; j1 < n; ++j1) {
for (int i2 = 0; i2 < n; ++i2) {
if (i1 == i2) continue;
for (int j2 = 0; j2 < n; ++j2) {
if (j1 == j2) continue;
int summ = a[i1][j1] + a[i2][j2];
if (a[i1][j2] == summ) {
cig[i1][j2] = true;
}
if (a[i2][j1] == summ) {
cig[i2][j1] = true;
}
}
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
yes &= cig[i][j];
}
}
if (yes) {
cout << "Yes";
} else {
cout << "No";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589793238;
long long powmod(long long a, long long b) {
long long res = 1;
a %= 1000000007;
for (; b; b >>= 1) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
}
return res;
}
int arr[100][100], col[100][100];
bool found(int left, int right, int item, int arr[]) {
while (left <= right) {
int mid = (left + right) >> 1;
if (arr[mid] == item)
return true;
else if (item > arr[mid])
left = mid + 1;
else
right = mid - 1;
}
return false;
}
int main() {
int n, num;
bool flag = true, f;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> arr[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
col[i][j] = arr[j][i];
}
}
for (int i = 0; i < n; i++) sort(col[i], col[i] + n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (arr[i][j] > 1) {
f = false;
for (int k = 0; k < n; k++) {
num = arr[i][j] - arr[i][k];
if (found(0, n - 1, num, col[j])) {
f = true;
break;
}
}
if (!f) {
flag = false;
break;
}
}
}
if (!flag) break;
}
if (flag) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int arr[n][n];
int flag = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> arr[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (arr[i][j] != 1) {
int c = 0;
for (int k = 0; k < n; k++) {
int to_f = arr[i][j] - arr[k][j];
for (int l = 0; l < n; l++) {
if (arr[i][l] == to_f) c = 1;
}
}
if (c == 0) flag = 0;
}
if (flag)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
char s[1000500];
int a[55][55], n;
int main() {
n = read();
int gg = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) a[i][j] = read();
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (a[i][j] != 1) {
int flag = 0;
for (int k = 1; k <= n; k++)
for (int p = 1; p <= n; p++)
if (a[i][k] + a[p][j] == a[i][j]) {
flag = 1;
break;
}
if (!flag) {
gg = 1;
break;
}
}
}
if (gg)
puts("No");
else
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int grid[n + 1][n + 1];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> grid[i][j];
}
}
bool good = false;
if (n == 1) {
if (grid[0][0] <= 1) {
good = true;
}
} else {
for (int i = 0; i < n; i++) {
bool breakAll = false;
for (int j = 0; j < n; j++) {
if (grid[i][j] > 1) {
bool ok = false;
for (int x = 0; x < n; x++) {
for (int y = 0; y < n; y++) {
if (grid[x][j] + grid[i][y] == grid[i][j]) {
good = true;
ok = true;
break;
}
}
}
if (ok == 0) {
good = false;
breakAll = true;
break;
}
}
}
if (breakAll) {
break;
}
}
}
if (good) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[53][53];
int main() {
ios_base::sync_with_stdio(0);
long long n, i, j, k, l, s;
bool f;
cin >> n;
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
for (i = 0; i < n; ++i) {
for (j = 0; j < n; ++j) {
if (a[i][j] == 1) {
continue;
}
f = 1;
for (k = 0; k < n; ++k) {
if (!f) {
break;
}
for (l = 0; l < n; ++l) {
if (a[i][k] + a[l][j] == a[i][j]) {
f = 0;
break;
}
}
}
if (f) {
cout << "No\n";
return 0;
}
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
int a[n][n];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> k;
a[i][j] = k;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j] != 1) {
bool b = false;
for (int j1 = 0; (j1 < n); ++j1) {
if (j1 == j) continue;
for (int i1 = 0; (i1 < n); ++i1) {
if (i1 == i) continue;
if (a[i][j] == (a[i1][j]) + (a[i][j1])) {
b = true;
}
}
}
if (b == false) {
cout << "NO";
return 0;
}
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d = 0, l = 0, f = -1, t;
cin >> n;
int a[n][n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) cin >> a[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int f = 0;
if (a[i][j] == 1) continue;
for (int x1 = 0, y1 = j; x1 < n; x1++)
for (int x2 = i, y2 = 0; y2 < n; y2++)
if (a[i][j] == a[x1][y1] + a[x2][y2]) f = 1;
if (f == 0) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, i, j, cnt = 0, k, l, temp = 0, flag = 0;
cin >> n;
int a[n][n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
cin >> a[i][j];
if (a[i][j] != 1) flag++;
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] != 1) {
temp = 0;
for (k = 0; k < n; k++) {
for (l = 0; l < n; l++) {
if (a[i][j] == (a[l][j] + a[i][k])) {
temp = 1;
break;
}
}
if (temp == 1) {
cnt++;
break;
}
}
}
}
}
if (cnt == flag)
cout << "Yes";
else
cout << "No";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.