text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
int main() {
bool f = false;
int r1, r2, c1, c2, d1, d2, a, b, c, d;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (a = 1; a < 10; ++a) {
for (b = 1; b < 10; ++b) {
if (a == b) continue;
for (c = 1; c < 10; ++c) {
if (a == c || b == c) continue;
for (d = 1; d < 10; ++d) {
if (a == d || b == d || c == d) continue;
if (a + b == r1 && c + d == r2 && a + c == c1 && b + d == c2 &&
a + d == d1 && b + c == d2) {
f = true;
printf("%d %d\n%d %d\n", a, b, c, d);
}
}
}
}
}
if (!f) puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2;
int i, j, k, l;
bool b[10];
for (i = 0; i < 10; i++) b[i] = false;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (i = 1; i < 10; i++) {
b[i] = true;
for (j = 1; j < 10; j++) {
if (b[j]) continue;
b[j] = true;
for (k = 1; k < 10; k++) {
if (b[k]) continue;
b[k] = true;
for (l = 1; l < 10; l++) {
if (b[l]) continue;
if (i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && j + k == d2) {
printf("%d %d\n", i, j);
printf("%d %d\n", k, l);
return 0;
}
}
b[k] = false;
}
b[j] = false;
}
b[i] = false;
}
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline double MTD(const double minutes) { return minutes / 60; }
inline double rad(const double deg) {
return (deg * (long double)acos(-1.0) / 180.0);
}
inline double deg(double rad) {
if (rad < 0) rad += 2 * (long double)acos(-1.0);
return (rad * 180) / (long double)acos(-1.0);
}
FILE *fptr = fopen("output.txt", "r");
int a[3][3];
map<int, int> m;
bool check(int x, int b, int c, int d) {
m.clear();
if (x + b != a[0][0]) return false;
if (x + c != a[1][0]) return false;
if (x + d != a[2][0]) return false;
if (b + d != a[1][1]) return false;
if (b + c != a[2][1]) return false;
if (c + d != a[0][1]) return false;
m[x]++;
m[b]++;
m[c++];
m[d++];
if (m.size() != 4) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
for (int i = 0; i < 3; i++)
for (int j = 0; j < 2; j++) cin >> a[i][j];
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
for (int k = 1; k <= 9; k++)
for (int l = 1; l <= 9; l++)
if (check(i, j, k, l)) {
cout << i << ' ' << j << endl << k << ' ' << l;
return 0;
}
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
bool ascending(int i, int j) { return (i < j); }
bool descending(int i, int j) { return (i > j); }
using namespace std;
int main() {
int r1, r2, d1, d2, c1, c2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int(a) = (1); (a) < (10); (a)++)
for (int(b) = (1); (b) < (10); (b)++)
for (int(c) = (1); (c) < (10); (c)++)
for (int(d) = (1); (d) < (10); (d)++) {
set<int> st;
st.insert(a);
st.insert(b);
st.insert(c);
st.insert(d);
if (st.size() != 4) continue;
if (a + d == d1 && b + c == d2 && a + b == r1 && c + d == r2 &&
a + c == c1 && b + d == c2) {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
return 0;
}
}
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int c1, c2, r1, r2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int a = 1; a <= 9; a++) {
for (int b = 1; b <= 9; b++) {
for (int c = 1; c <= 9; c++) {
for (int d = 1; d <= 9; d++) {
if (a + d == d1 && b + c == d2 && a + b == r1 && c + d == r2 &&
a + c == c1 && b + d == c2) {
if (a != b && a != c && a != d && b != c && b != d && c != d) {
cout << a << " " << b << " " << endl << c << " " << d << endl;
return 0;
}
}
}
}
}
}
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check(long long int a, long long int b, long long int c, long long int d) {
map<long long int, long long int> m;
m[a] = 1;
if (m[b]) return false;
m[b] = 1;
if (m[c]) return false;
m[c] = 1;
if (m[d]) return false;
m[d] = 1;
return true;
}
void solve() {
long long int r1, r2;
long long int c1, c2;
long long int d1, d2;
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
for (long long int i = 1; i <= 9; i++) {
for (long long int j = 1; j <= 9; j++) {
for (long long int k = 1; k <= 9; k++) {
for (long long int l = 1; l <= 9; l++) {
if (check(i, j, k, l)) {
if (i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && k + j == d2) {
cout << i << " " << j << endl;
cout << k << " " << l << endl;
return;
}
}
}
}
}
}
cout << -1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int T;
T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (j == i) j++;
if (j > 9) break;
for (int k = 1; k <= 9; k++) {
if (k == j || k == i) k++;
if (k > 9) break;
for (int l = 1; l <= 9; l++) {
if (l == k || l == j || l == i) l++;
if (l > 9) break;
if (r1 == i + j && r2 == k + l && c1 == i + k && c2 == j + l &&
d1 == i + l && d2 == j + k) {
cout << i << " " << j << endl << k << " " << l << endl;
return 0;
}
}
}
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a, b, c, d;
a = (r1 + c1 - d2);
b = (r1 + c2 - d1);
c = (c1 + r2 - d1);
d = (r2 + c2 - d2);
if (((a % 2 - 1) * (b % 2 - 1) * (c % 2 - 1) * (d % 2 - 1) != 0) && a > 0 &&
a < 19 && b > 0 && b < 19 && c > 0 && c < 19 && d > 0 && d < 19 &&
(a - b) * (c - d) * (a - c) * (a - d) * (b - d) * (b - c) != 0)
cout << a / 2 << " " << b / 2 << "\n" << c / 2 << " " << d / 2;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
while (cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2) {
int a, b, c, d;
b = (r1 - c1 + d2) / 2;
a = r1 - b;
c = c1 - a;
d = c2 - b;
if (a + b != r1 or c + d != r2 or a + c != c1 or b + d != c2 or
a + d != d1 or b + c != d2) {
cout << -1 << endl;
continue;
}
if (a == b || a == c or a == d or b == c or b == d or c == d or a < 1 or
b < 1 or c < 1 or d < 1 or a > 9 or b > 9 or c > 9 or d > 9)
cout << -1 << endl;
else
cout << a << ' ' << b << endl << c << ' ' << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename T1>
T amax(T a, T1 b) {
if (b > a) a = b;
return a;
}
template <typename T, typename T1>
T amin(T a, T1 b) {
if (b < a) a = b;
return a;
}
template <typename T>
T amod(T a) {
if (a < 0) a = -a;
return a;
}
void solve() {
long long int c1, c2, d1, d2, r1, r2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
long long int i = (c1 - d2 + r1) % 2 ? -1 : (c1 - d2 + r1) / 2;
long long int j = (r1 - c1 + d2) % 2 ? -1 : (r1 - c1 + d2) / 2;
long long int k = (r2 - c2 + d2) % 2 ? -1 : (r2 - c2 + d2) / 2;
long long int l = (c2 - d2 + r2) % 2 ? -1 : (c2 - d2 + r2) / 2;
if (i == j || i == k || i == l || j == k || j == l || k == l) {
cout << "-1";
return;
}
if (i >= 1 && i <= 9 && j >= 1 && j <= 9 && k >= 1 && k <= 9 && l >= 1 &&
l <= 9) {
cout << i << " " << j << "\n" << k << " " << l;
} else {
cout << "-1";
}
}
int main() {
long long int t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d %d\n", &r1, &r2);
scanf("%d %d\n", &c1, &c2);
scanf("%d %d", &d1, &d2);
int a, b, c, d;
b = (r1 - c1 + d2) / 2;
c = d2 - b;
a = c1 - c;
d = c2 - b;
if (a != b && b != c && c != d && d != a && a != c && b != d && a > 0 &&
a < 10 && b < 10 && b > 0 && c < 10 && c > 0 && d < 10 && d > 0) {
if (a + b == r1 && c + d == r2 && a + c == c1 && b + d == c2 &&
a + d == d1 && b + c == d2)
printf("%d %d\n%d %d", a, b, c, d);
else
printf("-1");
} else
printf("-1");
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 11;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
for (int k = 1; k <= 9; k++)
for (int t = 1; t <= 9; t++)
if (i != j && i != k && i != t && j != k && j != t && k != t &&
i + j == r1 && k + t == r2 && i + k == c1 && j + t == c2 &&
i + t == d1 && j + k == d2) {
cout << i << " " << j << endl;
cout << k << " " << t << endl;
return 0;
}
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2;
while (scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2) != EOF) {
int n = 0;
int a, b, c, d;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
for (c = 1; c <= 9; c++) {
for (d = 1; d <= 9; d++) {
if (a + b == r1 && c + d == r2 && a + c == c1 && b + d == c2 &&
a + d == d1 && b + c == d2 && a != b && a != c && a != d &&
b != c && b != d && c != d) {
printf("%d %d\n%d %d\n", a, b, c, d);
n++;
}
}
}
}
}
if (n == 0) printf("-1\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, k;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
if ((c1 + d1 - r2) % 2 == 1)
printf("-1\n");
else {
k = (c1 + d1 - r2) / 2;
if (k == (r1 - k) || k == (c1 - k) || k == (d1 - k) || r1 == c1 ||
r1 == d1 || c1 == d1)
printf("-1\n");
else if (k <= 0 || k > 9 || (r1 - k) <= 0 || (r1 - k) > 9 ||
(c1 - k) <= 0 || (c1 - k) > 9 || (d1 - k) <= 0 || (d1 - k) > 9)
printf("-1\n");
else {
printf("%d ", k);
printf("%d\n", r1 - k);
printf("%d ", c1 - k);
printf("%d\n", d1 - k);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, flag;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int n = 1; n <= 9; n++) {
if (i != j && i != k && i != n && j != k && j != n && k != n) {
flag++;
if (i + j == r1 && k + n == r2 && i + k == c1 && j + n == c2 &&
i + n == d1 && j + k == d2) {
cout << i << " " << j << endl << k << " " << n << endl;
return 0;
} else if (flag == 3024)
cout << "-1" << endl;
}
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a1 = ((r1 + c1 - d2)) % 2 == 0 ? ((r1 + c1 - d2) / 2) : -1;
int a2 = ((r1 + c2 - d1)) % 2 == 0 ? ((r1 + c2 - d1) / 2) : -1;
int a3 = ((r2 + c1 - d1)) % 2 == 0 ? ((r2 + c1 - d1) / 2) : -1;
int a4 = ((r2 + c2 - d2)) % 2 == 0 ? ((r2 + c2 - d2) / 2) : -1;
if (a1 < 1 || a2 < 1 || a3 < 1 || a4 < 1 || a1 > 9 || a2 > 9 || a3 > 9 ||
a4 > 9 || a1 == a2 || a1 == a3 || a1 == a4 || a2 == a3 || a2 == a4 ||
a3 == a4) {
cout << "-1";
} else {
cout << a1 << " " << a2 << endl;
cout << a3 << " " << a4;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; ++i) {
bool print = true;
int arr[30] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int r11 = i;
int r12 = r1 - r11;
int r21 = c1 - r11;
int r22 = r2 - r21;
if ((r11 > 9 || r11 < 0) || (r12 > 9 || r12 < 0) || (r21 > 9 || r21 < 0) ||
(r22 > 9 || r22 < 0))
continue;
arr[r11] += 1;
arr[r12] += 1;
arr[r21] += 1;
arr[r22] += 1;
if ((r12 == r1 - r11) && (r21 == c1 - r11) && (r22 == r2 - r21)) {
if (d1 == r11 + r22 && d2 == r12 + r21) {
for (int s = 0; s < 10; s++)
if (arr[s] > 1) print = false;
if (r11 <= 0 || r12 <= 0 || r21 <= 0 || r22 <= 0) print = false;
if (print) {
cout << r11 << " " << r12 << endl;
cout << r21 << " " << r22 << endl;
exit(0);
}
}
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int g = 1; g <= 9; g++) {
if (i + j == a && k + g == b && i + k == c && j + g == d &&
i + g == e && j + k == f && i != j && i != k && i != g &&
j != k && j != g && k != g) {
cout << i << " " << j << endl;
cout << k << " " << g << endl;
return 0;
}
}
}
}
}
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a, b, c, d;
a = (r1 + c1 - d2) / 2;
b = r1 - a;
c = d2 - b;
d = r2 - c;
int x = c1 + c2 - d1 - d2;
int y = d1 + d2 - r1 - r2;
if (a <= 0 || b <= 0 || c <= 0 || d <= 0 || a == b || b == c || c == d ||
d == a || a == c || b == d || a > 9 || b > 9 || c > 9 || d > 9 || x < 0 ||
y < 0)
cout << "-1";
else
cout << a << " " << b << "\n" << c << " " << d;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d, e, f, g, i, j, k, t, x, y, z, m, n;
int flag = 0;
cin >> a >> b >> c >> d >> e >> f;
for (x = 1; x < 10; x++) {
for (y = 1; y < 10; y++) {
for (m = 1; m < 10; m++) {
for (n = 1; n < 10; n++) {
if (x + y == a && m + n == b && x + m == c && y + n == d &&
x + n == e && y + m == f && x != y && x != m && x != n &&
y != m && y != n && m != n) {
cout << x << " " << y << endl << m << " " << n;
flag = 1;
}
}
}
}
}
if (flag == 0) cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
template <typename t1>
t1 gcd(t1 a, t1 b) {
return b == 0 ? a : gcd(b, a % b);
}
template <typename t1>
t1 lcm(t1 a, t1 b) {
return a * (b / gcd(a, b));
}
int main() {
int r1, r2, c1, c2, d1, d2;
while (cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2) {
int a, b, c, d;
int flag = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int l = 1; l <= 9; l++) {
if (i != j && i != k && i != l && j != k && j != l && k != l &&
i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && j + k == d2) {
a = i;
b = j;
c = k;
d = l;
flag = 1;
break;
}
}
}
}
}
if (flag)
cout << a << " " << b << endl << c << " " << d << endl;
else
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2, key[2][2];
int i1, i2, i3, i4, flag = 0;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
for (i1 = 1; i1 < 10; i1++) {
for (i2 = 1; i2 < 10; i2++) {
for (i3 = 1; i3 < 10; i3++) {
for (i4 = 1; i4 < 10; i4++) {
if ((i1 + i2 == r1) && (i3 + i4 == r2) && (i1 + i3 == c1) &&
(i2 + i4 == c2) && (i1 + i4 == d1) && (i2 + i3 == d2)) {
flag = 1;
break;
}
}
if (flag == 1) break;
}
if (flag == 1) break;
}
if (flag == 1) break;
}
if ((i1 != i2) && (i1 != i3) && (i1 != i4) && (i2 != i3) && (i2 != i4) &&
(i3 != i4))
flag = 2;
if (flag == 2)
printf("%d %d\n%d %d", i1, i2, i3, i4);
else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
set<int> ani;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a11 = (r1 + c1 - d2) / 2;
int a22 = d1 - a11;
int a12 = r1 - a11;
int a21 = c1 - a11;
ani.insert(a11);
ani.insert(a12);
ani.insert(a21);
ani.insert(a22);
if (ani.size() == 4 && a11 >= 1 && a11 <= 9 && a12 >= 1 && a12 <= 9 &&
a21 >= 1 && a21 <= 9 && a22 >= 1 && a22 <= 9 && a21 + a22 == r2 &&
a12 + a22 == c2 && a12 + a21 == d2) {
cout << a11 << " " << a12 << endl;
cout << a21 << " " << a22 << endl;
} else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int m[2][2];
for (int a = 1; a < 10; a++) {
for (int b = 1; b < 10; b++) {
for (int c = 1; c < 10; c++) {
for (int d = 1; d < 10; d++) {
if (a == b || a == c || a == d || b == c || b == d || c == d)
continue;
if (a + b != r1) continue;
if (c + d != r2) continue;
if (a + c != c1) continue;
if (b + d != c2) continue;
if (a + d != d1) continue;
if (b + c != d2) continue;
cout << a << " " << b << endl << c << " " << d;
exit(0);
}
}
}
}
cout << -1;
fclose(stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> split(const string& s, const string& delim = " ") {
vector<string> res;
string t;
for (int i = 0; i != s.size(); i++) {
if (delim.find(s[i]) != string::npos) {
if (!t.empty()) {
res.push_back(t);
t = "";
}
} else {
t += s[i];
}
}
if (!t.empty()) {
res.push_back(t);
}
return res;
}
vector<int> splitInt(const string& s, const string& delim = " ") {
vector<string> tok = split(s, delim);
vector<int> res;
for (int i = 0; i != tok.size(); i++) res.push_back(atoi(tok[i].c_str()));
return res;
}
template <typename T>
void print(T a) {
cerr << a;
}
static void print(long long a) { cerr << a << "L"; }
static void print(string a) { cerr << '"' << a << '"'; }
template <typename T>
void print(vector<T> a) {
cerr << "{";
for (int i = 0; i != a.size(); i++) {
if (i != 0) cerr << ", ";
print(a[i]);
}
cerr << "}" << endl;
}
int r1, r2, c1, c2, d1, d2;
bool valid(vector<int>& x) {
bool can = true;
can &= (x[0] + x[1] == r1);
can &= (x[2] + x[3] == r2);
can &= (x[0] + x[2] == c1);
can &= (x[1] + x[3] == c2);
can &= (x[0] + x[3] == d1);
can &= (x[1] + x[2] == d2);
return can;
}
int main() {
while (cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2) {
vector<int> p;
for (int i = 0, _n = (5); i < _n; i++) p.push_back(0);
for (int i = 0, _n = (4); i < _n; i++) p.push_back(1);
vector<int> res;
bool found = 0;
do {
vector<int> temp;
for (int i = 0, _n = (p.size()); i < _n; i++)
if (p[i]) temp.push_back(i + 1);
do {
if (valid(temp)) {
res = temp;
found = 1;
break;
}
} while (next_permutation(temp.begin(), temp.end()));
} while (!found && next_permutation(p.begin(), p.end()));
if (!found)
cout << -1 << endl;
else {
cout << res[0] << " " << res[1] << endl;
cout << res[2] << " " << res[3] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
for (int a = 1; a <= 9; a++) {
for (int b = 1; b <= 9; b++) {
for (int c = 1; c <= 9; c++) {
for (int d = 1; d <= 9; d++) {
if (a != b && a != c && a != d && b != c && b != d && c != d) {
if (a + d == d1 && b + c == d2 && a + c == c1 && b + d == c2 &&
a + b == r1 && c + d == r2) {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
return 0;
}
}
}
}
}
}
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2;
std::cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int ii, j, jj;
for (int i = 1; i != 10; ++i) {
ii = r1 - i;
j = c1 - i;
jj = d1 - i;
if (ii > 0 && ii < 10 && j > 0 && j < 10 && jj > 0 && jj < 10 &&
j + ii == d2 && j + jj == r2 && ii + jj == c2 && i != ii && i != j &&
i != jj && ii != j && ii != jj && j != jj) {
std::cout << i << " " << ii << std::endl;
std::cout << j << " " << jj << std::endl;
return 0;
}
}
std::cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2, ans = 0, i, j, k, l;
int main() {
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
for (i = 1; i < 10; i++) {
for (j = 1; j < 10; j++) {
for (k = 1; k < 10; k++) {
for (l = 1; l < 10; l++) {
if (i + k == c1 && j + l == c2 && i + j == r1 && k + l == r2 &&
i + l == d1 && k + j == d2) {
ans = 1;
break;
}
}
if (ans == 1) break;
}
if (ans == 1) break;
}
if (ans == 1) break;
}
if (ans == 1 && i != j && i != k && i != l && j != k && j != l && k != l)
cout << i << " " << j << endl << k << " " << l << endl;
else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
bool eshta = false;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (i == j) continue;
for (int c = 1; c <= 9; c++) {
if (i == c || j == c) continue;
for (int l = 1; l <= 9; l++) {
if (i == l || c == l || j == l) continue;
if (i + j == r1 && c + l == r2 && i + c == c1 && l + j == c2 &&
i + l == d1 && c + j == d2) {
eshta = true;
cout << i << " " << j << endl << c << " " << l;
}
}
}
}
}
if (eshta == false) {
cout << -1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int x1 = (d1 - r2 + c1) / 2;
int y1 = r1 - x1;
int x2 = c1 - x1;
int y2 = (r2 - c1 + x1);
if (x1 == x2 || x1 == y1 || x1 == y2 || x2 == y1 || x2 == y2 || y1 == y2) {
cout << "-1" << endl;
} else if (x1 == 0 || y1 == 0 || x2 == 0 || y2 == 0 || x1 > 9 || x2 > 9 ||
y1 > 9 || y2 > 9) {
cout << "-1" << endl;
} else {
cout << x1 << " " << y1 << endl;
cout << x2 << " " << y2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
int a, b, c, d, ok;
ok = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
for (c = 1; c <= 9; c++) {
for (d = 1; d <= 9; d++) {
if (a == b || a == c || a == d || b == c || b == d || c == d)
continue;
if (r1 != a + b) continue;
if (r2 != c + d) continue;
if (c1 != a + c) continue;
if (c2 != b + d) continue;
if (d1 != a + d) continue;
if (d2 != c + b) continue;
ok = 1;
break;
}
if (ok) break;
}
if (ok) break;
}
if (ok) break;
}
if (ok == 0)
puts("-1");
else
printf("%d %d\n%d %d\n", a, b, c, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 44;
int main() {
int r1, r2, c1, c2, d1, d2, a, b, c, d, f;
while (cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2) {
f = 0;
for (a = 1; a < 10; a++)
for (b = 1; b < 10; b++)
if (b != a && a + b == r1)
for (c = 1; c < 10; c++)
if (c != a && c != b && a + c == c1 && c + b == d2)
for (d = 1; d < 10; d++)
if (d != a && d != b && d != c && c + d == r2 && b + d == c2 &&
a + d == d1) {
f = 1;
goto end;
}
end:
if (f)
cout << a << " " << b << endl << c << " " << d << endl;
else
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, h, c1, c2, r1, r2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
y = (r1 - c1 + d2) / 2;
x = r1 - y;
z = d2 - y;
h = c2 - y;
if (x == y || x == z || x == h || y == z || y == h || z == h || x <= 0 ||
y <= 0 || z <= 0 || h <= 0 || x > 9 || y > 9 || h > 9 || z > 9)
cout << -1 << endl;
else if (x + y == r1 && x + z == c1 && x + h == d1 && y + z == d2 &&
y + h == c2 && z + h == r2) {
cout << x << ' ' << y << endl;
cout << z << ' ' << h << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int x1, x2, x3, x4, num, a, b, c, d, e, f, g, h, i, j;
while (scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f) != EOF) {
num = 0;
for (g = 1; g <= 9; g++) {
for (h = 1; h <= 9; h++) {
if (h == g) {
continue;
} else {
for (i = 1; i <= 9; i++) {
if (i == g || i == h) {
continue;
} else {
for (j = 1; j <= 9; j++) {
if (j == g || j == h || j == i) {
continue;
} else {
if ((a == g + h) && (b == i + j) && (e == g + j) &&
(c == g + i) && (d == h + j) && (f == h + i)) {
num = num + 1;
x1 = g;
x2 = h;
x3 = i;
x4 = j;
}
}
}
}
}
}
}
}
if (num == 0) {
printf("-1\n");
} else {
printf("%d %d\n", x1, x2);
printf("%d %d\n", x3, x4);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int num1, num2, num3, num4, flag = 0;
for (int i = 1; i < r1; i++) {
num1 = i;
num2 = r1 - i;
if (c1 - num1 > 0 && num1 <= 9) {
flag++;
num3 = c1 - num1;
} else {
flag = 0;
continue;
}
if (c2 - num2 > 0 && num2 <= 9) {
flag++;
num4 = c2 - num2;
} else {
flag = 0;
continue;
}
if (num3 + num4 == r2 && num3 <= 9)
flag++;
else {
flag = 0;
continue;
}
if (num1 + num4 == d1 && num4 <= 9)
flag++;
else {
flag = 0;
continue;
}
if (num2 + num3 == d2)
flag++;
else {
flag = 0;
continue;
}
if (flag == 5 && num1 != num2 && num1 != num3 && num1 != num4 &&
num2 != num3 && num2 != num4 && num3 != num4) {
cout << num1 << " " << num2 << "\n" << num3 << " " << num4;
return 0;
}
}
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int x1, x2, x3, x4, r1, r2, c1, c2, d1, d2;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
x1 = (r1 + c1 - d2) / 2;
x2 = r1 - x1;
x3 = (c1 + d2 - r1) / 2;
x4 = r2 - x3;
if ((x1 >= 1 && x1 <= 9) && (x2 >= 1 && x2 <= 9) && (x3 >= 1 && x3 <= 9) &&
(x4 >= 1 && x4 <= 9)) {
if (x1 != x2 && x3 != x4 && x1 != x3 && x1 != x4 && x2 != x3 && x2 != x4) {
if ((x1 + x2 == r1) && (x3 + x4 == r2) && (x1 + x3 == c1) &&
(x2 + x4 == c2) && (x1 + x4 == d1) && (x2 + x3 == d2))
printf("%d %d\n%d %d\n", x1, x2, x3, x4);
else
printf("-1\n");
} else
printf("-1\n");
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2, x;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
if ((r1 + r2) == (c1 + c2) && (c1 + c2) == (d1 + d2) &&
(r1 + r2) == (d1 + d2)) {
x = (d1 + r1 - c2) / 2;
if (x) {
int a, b, c, d;
a = x;
b = r1 - x;
c = c1 - x;
d = c2 - r1 + x;
if (a != b && b != c && c != d && a != d && b != d && c != a && a <= 9 &&
b <= 9 && c <= 9 && d <= 9 && a >= 1 && b >= 1 && c >= 1 && d >= 1)
printf("%d %d\n%d %d", a, b, c, d);
else
printf("-1\n");
} else
printf("-1\n");
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r[2], c[2], d[2];
int n[3];
int cntn = 0;
int main() {
cin >> r[0] >> r[1] >> c[0] >> c[1] >> d[0] >> d[1];
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
if (i + j == r[0] && i != j)
for (int q = 1; q <= 9; q++)
if (i != q && j != q && i + q == c[0] && j + q == d[1])
for (int k = 1; k <= 9; k++)
if (i != k && j != k && q != k && i + k == d[0] &&
j + k == c[1] && q + k == r[1]) {
cout << i << " " << j << endl << q << " " << k << endl;
return 0;
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int r1, r2, c1, c2, d1, d2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
int a, b, c, d;
int first_sum = r1 - c2 + d1;
if (first_sum % 2 == 0) {
a = first_sum / 2;
b = r1 - a;
c = c1 - a;
d = d1 - a;
if ((d2 - b != c) || (c2 - b != d) || (r2 - c != d)) {
cout << "-1" << endl;
return 0;
}
if (a > 0 && b > 0 && c > 0 && d > 0 && a < 10 && b < 10 && c < 10 &&
d < 10 && a != b && a != c && a != d && b != c && b != d && c != d) {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
} else {
cout << "-1" << endl;
}
} else {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c1, c2, r1, r2, d1, d2;
bool flag = false;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
for (int k = 1; k <= 9; k++)
for (int m = 1; m <= 9; m++) {
if (i != j && i != k && i != m && j != k && j != m && k != m) {
if (i + m == d1 && j + k == d2 && i + j == r1 && k + m == r2 &&
i + k == c1 && j + m == c2) {
if (flag) break;
flag = true;
cout << i << " " << j << endl;
cout << k << " " << m << endl;
break;
}
}
}
if (!flag) cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
int a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
a = (r1 - d2 + c1) / 2;
b = r1 - a;
c = c1 - a;
d = c2 - b;
if (a < 1 || b < 1 || c < 1 || d < 1 || a > 9 || b > 9 || c > 9 || d > 9) {
cout << "-1";
} else if (a == b || b == d || b == c || a == d || c == d || a == c ||
c + d != r2) {
cout << "-1";
} else {
cout << a << " " << b << "\n" << c << " " << d;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int num[10], cells[10];
bool used[10];
bool bt(int idx) {
if (idx == 4) {
if (num[0] == cells[0] + cells[1] && num[1] == cells[2] + cells[3] &&
num[2] == cells[0] + cells[2] && num[3] == cells[1] + cells[3] &&
num[4] == cells[0] + cells[3] && num[5] == cells[1] + cells[2])
return true;
else
return false;
} else {
for (int i = 1; i <= 9; i++) {
if (!used[i]) {
cells[idx] = i;
used[i] = true;
if (bt(idx + 1)) return true;
used[i] = false;
}
}
return false;
}
}
int main() {
for (int i = 0; i < 6; i++) cin >> num[i];
memset(used, false, sizeof used);
memset(cells, -1, sizeof cells);
if (bt(0))
cout << cells[0] << " " << cells[1] << endl
<< cells[2] << " " << cells[3] << endl;
else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int a = 1; a < 10; ++a) {
for (int b = 1; b < 10; ++b) {
for (int c = 1; c < 10; ++c) {
for (int d = 1; d < 10; ++d) {
if (a + d == d1 && c + b == d2 && a + b == r1 && c + d == r2 &&
a + c == c1 && b + d == c2) {
if (a != b && a != c && a != d && b != c && b != d && c != d) {
cout << a << " " << b << endl << c << " " << d;
return 0;
}
}
}
}
}
}
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
bool flag;
int main() {
while (~scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2)) {
flag = true;
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
if (j != i)
for (int k = 1; k <= 9; k++)
if (k != i && k != j)
for (int l = 1; l <= 9; l++)
if (l != i && l != j && l != k) {
if (i + j == r1 && k + l == r2 && i + k == c1 &&
j + l == c2 && i + l == d1 && j + k == d2) {
flag = false;
cout << i << " " << j << endl;
cout << k << " " << l << endl;
break;
}
}
if (flag) cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
if (i + j == r1)
for (int k = 1; k < 10; k++)
if (j + k == d2 && i + k == c1)
for (int l = 1; l < 10; l++)
if (k + l == r2 && j + l == c2 && i + l == d1 && i != l &&
j != l && k != l && i != k && j != k && i != j) {
printf("%d %d\n%d %d", i, j, k, l);
return 0;
}
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
double c1, c2, r1, r2, d1, d2, i, j, k, l;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
l = (r2 - d2 + c2) / 2;
i = d1 - l;
k = c1 - i;
j = d2 - k;
if ((i >= 1 && i <= 9) && (j >= 1 && j <= 9) && (k >= 1 && k <= 9) &&
(l >= 1 && l <= 9) && (i != j) && (i != k) && (i != l) && (j != k) &&
(j != l) && (k != l)) {
cout << (int)i << " " << (int)j << endl;
cout << (int)k << " " << (int)l << endl;
} else {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int p, q, r, s;
p = ((d1 + r1 + c1) - (d2 + c2 + r2) / 2) / 3;
q = r1 - p;
r = c1 - p;
s = d1 - p;
if (p != q && p != r && p != s && q != r && q != s && r != s) {
if ((p > 0 && p < 10) && (q > 0 && q < 10) && (r > 0 && r < 10) &&
(s > 0 && s < 10)) {
if ((p + q == r1) && (r + s == r2) && (p + r == c1) && (q + s == c2) &&
(p + s == d1) && (q + r == d2)) {
cout << p << " " << q << endl << r << " " << s;
} else
cout << -1;
} else
cout << -1;
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
string toString(T x) {
if (x == 0) return "0";
bool negative = x < 0;
string res;
while (x) {
res.push_back('0' + x % 10);
x /= 10;
}
if (negative) res.push_back('-');
reverse(res.begin(), res.end());
return res;
}
void ioFromFile(string inputFileName, string outputFileName) {
ifstream fin(inputFileName);
ofstream fout(outputFileName);
cin.rdbuf(fin.rdbuf());
cout.rdbuf(fout.rdbuf());
}
int read() {
int res;
scanf("%d", &res);
return res;
}
template <typename T>
T gcd(T a, T b) {
return a == 0 ? b : gcd(b % a, a);
}
template <typename T>
T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
int main() {
int r0, r1, c0, c1, d0, d1;
cin >> r0 >> r1 >> c0 >> c1 >> d0 >> d1;
int res[2][2];
res[0][0] = r0 + c0 - d1;
if (res[0][0] % 2 == 1) {
cout << -1;
return 0;
}
res[0][0] /= 2;
res[0][1] = r0 - res[0][0];
res[1][0] = c0 - res[0][0];
res[1][1] = r1 - res[1][0];
if (res[0][0] + res[0][1] != r0 || res[1][0] + res[1][1] != r1 ||
res[0][0] + res[1][0] != c0 || res[0][1] + res[1][1] != c1 ||
res[0][0] + res[1][1] != d0 || res[1][0] + res[0][1] != d1) {
cout << -1;
return 0;
}
for (int i = 0; i < 4; i++) {
int x = res[i / 2][i % 2];
if (x < 1 || x > 9) {
cout << -1;
return 0;
}
for (int j = 0; j < 4; j++) {
if (i == j) continue;
int y = res[j / 2][j % 2];
if (x == y) {
cout << -1;
return 0;
}
}
}
for (int y = 0; y < 2; y++) {
for (int x = 0; x < 2; x++) {
cout << res[y][x] << " ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int r1, r2, c1, c2, d1, d2, i, j, k, l;
scanf("%d%d", &r1, &r2);
scanf("%d%d", &c1, &c2);
scanf("%d%d", &d1, &d2);
for (i = 1; i <= 9; i++)
for (j = r1 - i; j <= 9; j++)
for (k = c1 - i; k <= 9; k++)
for (l = d1 - i; l <= 9; l++) {
if (j >= 1 && k >= 1 && l >= 1 && (k + j) == d2 && (k + l) == r2 &&
(i + k) == c1 && (j + l) == c2) {
if ((i != j) && (i != k) && (i != l) && (j != k) && (j != l) &&
(k != l)) {
printf("%d %d\n%d %d", i, j, k, l);
return 0;
}
}
}
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
for (int k = 1; k <= 9; k++)
for (int l = 1; l <= 9; l++)
if (i + k == c1 && j + l == c2 && i + j == r1 && k + l == r2 &&
i + l == d1 && j + k == d2 && i != j && i != k && i != l &&
j != k && j != l && k != l) {
cout << i << " " << j << endl << k << " " << l << endl;
return 0;
}
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int r1, r2;
int c1, c2;
int d1, d2;
int countr1 = 0;
int countr2 = 0;
int a[100];
int b[100];
int i, j, k;
scanf("%d%d", &r1, &r2);
getchar();
scanf("%d%d", &c1, &c2);
getchar();
scanf("%d%d", &d1, &d2);
for (i = 1, j = 0; i <= 9; i++) {
if (r1 - i > 9)
continue;
else {
if (r1 - i <= 0) break;
a[j] = i;
a[j + 1] = r1 - i;
j += 2;
countr1++;
}
}
for (i = 1, j = 0; i <= 9; i++) {
if (r2 - i > 9)
continue;
else {
if (r2 - i <= 0) break;
b[j] = i;
b[j + 1] = r2 - i;
j += 2;
countr2++;
}
}
for (i = 0; i < countr1 * 2; i += 2) {
for (j = 0; j < countr2 * 2; j += 2) {
if (a[i] != b[j] && a[i] != b[j + 1] && a[i + 1] != b[j] &&
a[i + 1] != b[j + 1] && a[i] != a[i + 1] && b[j] != b[j + 1]) {
if (a[i] + b[j] == c1 && a[i + 1] + b[j + 1] == c2 &&
a[i] + b[j + 1] == d1 && a[i + 1] + b[j] == d2) {
printf("%d %d\n", a[i], a[i + 1]);
printf("%d %d\n", b[j], b[j + 1]);
return 0;
} else
continue;
} else
continue;
}
}
printf("%d", -1);
return 0;
}
|
#include <bits/stdc++.h>
const long long mod = (long long)1e9 + 7;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long e, f, g, h, i, j;
cin >> e >> f >> g >> h >> i >> j;
bool valid = false;
for (long long a = 1; a <= 9; a++) {
for (long long b = 1; b <= 9; b++) {
for (long long c = 1; c <= 9; c++) {
for (long long d = 1; d <= 9; d++) {
if (a != b and a != c and a != d and b != c and b != d and c != d and
a + d == i and b + c == j and a + b == e and c + d == f and
a + c == g and b + d == h) {
cout << a << " " << b << "\n" << c << " " << d << "\n";
valid = true;
break;
}
}
}
}
}
if (valid == false) {
cout << -1 << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, n[4], b[4];
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
n[0] = (d1 + c1 - r2) / 2;
b[0] = n[0];
n[1] = (c2 + d2 - r2) / 2;
b[1] = n[1];
n[2] = (c1 + d2 - r1) / 2;
b[2] = n[2];
n[3] = (c2 + d1 - r1) / 2;
b[3] = n[3];
sort(b, b + 4);
int m = (unique(b, b + 4) - b);
if (m == 4 && n[0] < 10 && n[1] < 10 && n[2] < 10 && n[3] < 10 && n[0] > 0 &&
n[1] > 0 && n[2] > 0 && n[3] > 0) {
cout << n[0] << " " << n[1] << "\n";
cout << n[2] << " " << n[3] << "\n";
} else
cout << "-1\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int a = 1; a <= 9; ++a) {
for (int b = 1; b <= 9; ++b) {
for (int c = 1; c <= 9; ++c) {
for (int d = 1; d <= 9; ++d) {
if (a == b or a == c or a == d or b == c or b == d or c == d)
continue;
if (a + b == r1 && a + d == d1 && a + c == c1 && b + d == c2 &&
b + c == d2 && d + c == r2) {
cout << a << " " << b << endl << c << " " << d << endl;
return 0;
}
}
}
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int main() {
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
for (int ii = 1; ii <= 9; ++ii)
for (int jj = 1; jj <= 9; ++jj) {
if (i != j && i != ii && i != jj && j != ii && j != jj && ii != jj)
if (i + j == r1 && jj + ii == r2 && i + ii == c1 && j + jj == c2 &&
i + jj == d1 && j + ii == d2) {
printf("%d %d\n%d %d", i, j, ii, jj);
return 0;
}
}
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
int a1, a2, a3, a4;
int flag = 0;
for (a1 = 1; a1 <= 9; a1++) {
for (a2 = 1; a2 <= 9; a2++) {
for (a3 = 1; a3 <= 9; a3++) {
for (a4 = 1; a4 <= 9; a4++) {
if (a1 + a2 == r1 && a3 + a4 == r2 && a1 + a3 == c1 &&
a2 + a4 == c2 && a1 + a4 == d1 && a2 + a3 == d2 && a1 != a2 &&
a2 != a3 && a3 != a4 && a1 != a3 && a1 != a4 && a2 != a4) {
flag = 1;
cout << a1 << " " << a2 << endl;
cout << a3 << " " << a4 << endl;
break;
}
}
}
}
}
if (!flag) {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const int maxn = 1e5 + 5;
int r1, r2, c1, c2, d1, d2;
int ans[5][5];
int main() {
while (cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2) {
int flag = 0;
for (int i = 1; i <= 9; i++) {
ans[0][0] = i;
ans[0][1] = r1 - i;
ans[1][0] = c1 - i;
ans[1][1] = c2 - ans[0][1];
if (ans[0][0] > 9 || ans[0][1] > 9 || ans[1][0] > 9 || ans[1][1] > 9)
continue;
if (ans[0][0] <= 0 || ans[0][1] <= 0 || ans[1][0] <= 0 || ans[1][1] <= 0)
continue;
if (ans[0][0] == ans[1][1] || ans[0][1] == ans[1][0] ||
ans[0][0] == ans[1][0] || ans[0][0] == ans[0][1] ||
ans[0][1] == ans[1][1] || ans[1][0] == ans[1][1])
continue;
if (ans[0][0] + ans[1][1] == d1 && ans[0][1] + ans[1][0] == d2 &&
ans[1][0] + ans[1][1] == r2) {
printf("%d %d\n%d %d\n", ans[0][0], ans[0][1], ans[1][0], ans[1][1]);
flag = 1;
break;
}
}
if (!flag) printf("-1\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int main() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
vector<int> nums;
if (r1 + r2 == c1 + c2 && c1 + c2 == d1 + d2) {
int x = (d1 + r1 - c2);
int y = (c2 + d2 - r2);
int w = (d1 + c2 - r1);
int z = (2 * c1 - d1 - r1 + c2);
if (x % 2 || y % 2 || z % 2 || w % 2) {
cout << -1;
return 0;
}
nums.push_back(x / 2);
nums.push_back(y / 2);
nums.push_back(z / 2);
nums.push_back(w / 2);
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
if (i != j && nums[i] == nums[j]) {
cout << -1;
return 0;
}
}
}
for (int i = 0; i < 4; i++) {
if (nums[i] >= 10 || nums[i] <= 0) {
cout << -1;
return 0;
}
}
cout << x / 2 << ' ' << y / 2 << '\n';
cout << z / 2 << ' ' << w / 2 << '\n';
return 0;
}
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
a = d1 - 1;
d = 1;
while (a > 0) {
b = r1 - a;
c = c1 - a;
if ((r1 == a + b) && (r2 == c + d) && (c1 == a + c) && (c2 == b + d) &&
(d2 == b + c) && (a != b) && (a != c) && (a != d) && (b != c) &&
(b != d) && (c != d) && (a < 10) && (b < 10) && (c < 10) & (d < 10))
break;
a--;
d++;
}
if ((a == 0) || (b == 0) || (c == 0) || (d == 0)) {
cout << -1 << endl;
return 0;
}
cout << a << " " << b << endl;
cout << c << " " << d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void exgcd(int a, int b, int *x, int *y) {
if (b) {
exgcd(b, a % b, y, x);
(*y) = (*y) - (a / b) * (*x);
} else
*x = 1, *y = 0;
}
int main() {
std::ios::sync_with_stdio(false);
double r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
double a, b, c, d;
b = (r1 + c2 - d1) / 2.0;
a = r1 - b;
d = c2 - b;
c = d2 - b;
if ((int)a == a && (int)b == b && (int)c == c && (int)d == d && a + b == r1 &&
c + d == r2 && a + d == d1 && c + b == d2 && a + c == c1 && b + d == c2) {
set<int> temp;
temp.insert(a);
temp.insert(b);
temp.insert(c);
temp.insert(d);
if (temp.size() == 4 && *(temp.begin()) > 0 && *(temp.rbegin()) < 10) {
cout << (int)a << " " << (int)b << endl;
cout << (int)c << " " << (int)d << endl;
} else
cout << -1;
} else
cout << -1;
}
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2, x1, x2, x3, x4;
scanf("%d %d", &r1, &r2);
scanf("%d %d", &c1, &c2);
scanf("%d %d", &d1, &d2);
x1 = r1 + c1 - d2;
x2 = r1 + c2 - d1;
x3 = r2 + c1 - d1;
x4 = r2 + c2 - d2;
if (x1 % 2 != 0)
printf("-1");
else if (x2 % 2 != 0)
printf("-1");
else if (x3 % 2 != 0)
printf("-1");
else if (x4 % 2 != 0)
printf("-1");
else if (x1 == x2)
printf("-1");
else if (x1 == x3)
printf("-1");
else if (x1 == x4)
printf("-1");
else if (x3 == x2)
printf("-1");
else if (x4 == x2)
printf("-1");
else if (x4 == x3)
printf("-1");
else if (((x1 < 1) || (x1 > 18)) || ((x2 < 1) || (x2 > 18)) ||
((x3 < 1) || (x3 > 18)) || ((x4 < 1) || (x4 > 18)))
printf("-1");
else {
printf("%d %d\n", x1 / 2, x2 / 2);
printf("%d %d\n", x3 / 2, x4 / 2);
}
}
|
#include <bits/stdc++.h>
bool isprime[100000];
using namespace std;
void setprime() {
for (int i = 1; i < 100005; i++) isprime[i] = true;
isprime[0] = false;
isprime[1] = false;
for (int i = 2; i * i < 100005; i++) {
if (isprime[i] == true) {
for (int j = (2 * i); j < 100005; j += i) isprime[j] = false;
}
}
}
long long mod = 1000000007;
long long N = 1000005;
long long abSolute(long long a) {
if (a >= 0)
return a;
else
return (-1) * a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed;
cout << setprecision(12);
long long r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
long long a, b, c, d;
for (long long i = 1; i < 10; i++) {
a = i;
b = r1 - a;
c = c1 - a;
d = r2 - c1 + a;
if (b < 10 && c < 10 && d < 10 && b > 0 && c > 0 && d > 0)
if ((a != b) && (a != c) && (a != d) && (b != c) && (b != d) && (c != d))
if ((a + d) == d1 && (b + c) == d2) {
cout << a << " " << b << "\n" << c << " " << d;
break;
}
if (i == 9) cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int checker(int a, int b, int c, int d) {
if ((a + c == c1) && (c + b == d2) && (c + d == r2) && (a + b == r1) &&
(a + d == d1) && (b + d == c2)) {
if (a != b && b != c && c != d && a != d && a != c && b != d) {
return 1;
} else
return 0;
} else
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int flag = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int l = 1; l <= 9; l++) {
if (checker(i, j, k, l)) {
cout << i << " " << j << endl << k << " " << l << endl;
flag = 1;
break;
}
}
}
}
}
if (flag == 0) cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int x[41];
int main() {
int a, b, c, d, r1, r2, c1, c2, d1, d2, i, l, m;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
l = d1 + d2;
m = r1 + r2 + c1 + c2;
if (2 * l != m)
cout << "-1", exit(0);
else {
a = (c1 + r1 - d2) / 2;
b = c2 + d2 - r2, b = b / 2;
c = c1 - a;
d = c2 - b;
x[a]++;
x[b]++;
x[c]++;
x[d]++;
for (i = 0; i <= 40; i++) {
if (x[i] > 1) cout << "-1", exit(0);
}
if (a > 0 && a < 10 && b > 0 && b < 10 && c > 0 && c < 10 && d > 0 &&
d < 10) {
cout << a << " " << b << "\n";
cout << c << " " << d;
} else
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int ans[2][2];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) ans[i][j] = 1;
for (int n1 = 1; n1 <= 9; n1++) {
for (int n2 = 1; n2 <= 9; n2++) {
for (int n3 = 1; n3 <= 9; n3++) {
for (int n4 = 1; n4 <= 9; n4++) {
if (n1 + n2 == r1 && n3 + n4 == r2 && n1 + n3 == c1 &&
n2 + n4 == c2 && n1 + n4 == d1 && n2 + n3 == d2 && n1 != n2 &&
n1 != n3 && n1 != n4 && n2 != n3 && n2 != n4 && n3 != n4) {
cout << n1 << " " << n2 << endl;
cout << n3 << " " << n4 << endl;
return 0;
}
}
}
}
}
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = (int)1e8;
const double EPS = 1e-11;
int diri[] = {0, 1, -1, 0};
int dirj[] = {1, 0, 0, -1};
int arr[30];
map<char, string> m;
int main() {
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
for (int i = 1; i < 10; ++i) {
for (int j = 1; j < 10; ++j) {
for (int k = 1; k < 10; ++k) {
for (int l = 1; l < 10; ++l) {
set<int> s;
s.insert(i);
s.insert(j);
s.insert(k);
s.insert(l);
if ((int)s.size() != 4) continue;
if (i + j == a && k + l == b && i + k == c && j + l == d &&
i + l == e && j + k == f) {
cout << i << " " << j << endl << k << " " << l << endl;
goto out;
}
}
}
}
}
cout << -1;
out:;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->ios::sync_with_stdio(0);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int mas[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
do {
if (mas[0] + mas[1] == r1 && mas[2] + mas[3] == r2 &&
mas[0] + mas[2] == c1 && mas[1] + mas[3] == c2 &&
mas[0] + mas[3] == d1 && mas[1] + mas[2] == d2) {
cout << mas[0] << ' ' << mas[1] << '\n';
cout << mas[2] << ' ' << mas[3] << '\n';
return 0;
}
} while (next_permutation(mas, mas + 9));
cout << "-1\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a, b, c, d;
c = (c1 + r2 - d1) / 2;
a = c1 - c;
b = r1 - a;
d = r2 - c;
if ((c1 + r2 - d1) % 2 == 0)
if (a != b and a != c and a != d and b != c and b != d and c != d)
if (a < 10 and b < 10 and c < 10 and d < 10)
if (a > 0 and b > 0 and c > 0 and d > 0) {
cout << a << " " << b << endl << c << " " << d << endl;
return 0;
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isnumber(int a);
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
if ((c1 + c2) != (d1 + d2)) {
cout << -1 << endl;
return 0;
}
int a = d1 + r1 - c2;
int b = r1 + c2 - d1;
int c = d2 + r2 - c2;
int d = r2 + c2 - d2;
if (isnumber(a) || isnumber(b) || isnumber(c) || isnumber(d)) {
cout << -1 << endl;
return 0;
}
a /= 2;
b /= 2;
c /= 2;
d /= 2;
set<int> num;
num.insert(a);
num.insert(b);
num.insert(c);
num.insert(d);
if (num.size() != 4) {
cout << -1 << endl;
return 0;
}
cout << a << " " << b << endl;
cout << c << " " << d << endl;
return 0;
}
bool isnumber(int a) { return (a % 2 || a < 1 || a > 18); }
|
#include <bits/stdc++.h>
int check(int i, int j, int k, int l, int r1, int r2, int c1, int c2, int d1,
int d2) {
if (i + j != r1) return 0;
if (k + l != r2) return 0;
if (i + k != c1) return 0;
if (j + l != c2) return 0;
if (i + l != d1) return 0;
if (j + k != d2)
return 0;
else
return 1;
}
int main() {
int i, j, k, l, r1, r2, d1, d2, c1, c2;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
int flag = 0;
for (i = 1; i < 10; i++) {
for (j = 1; j < 10; j++) {
if (i == j) continue;
for (k = 1; k < 10; k++) {
if (i == j || j == k || i == k) continue;
for (l = 1; l < 10; l++) {
if (i == j || j == k || k == l || i == k || i == l || j == l)
continue;
if (check(i, j, k, l, r1, r2, c1, c2, d1, d2)) {
flag = 1;
printf("%d %d\n", i, j);
printf("%d %d", k, l);
break;
}
}
if (flag == 1) break;
}
if (flag == 1) break;
}
if (flag == 1) break;
}
if (flag != 1) printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, i, x1, x2, x3, x4;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (i = 1; i <= 9; i++) {
x1 = i;
x4 = d1 - x1;
x2 = r1 - x1;
x3 = r2 - x4;
if (x4 > 9 || x2 > 9 || x3 > 9) continue;
if (x2 == x4 || x1 == x2 || x2 == x3 || x3 == x4 || x3 == x1 || x4 == x1 ||
x4 <= 0 || x2 <= 0 || x3 <= 0)
continue;
if (x2 != (d2 - x3) || x2 != (c2 - x4)) continue;
if (x3 != (d2 - x2) || x3 != (c1 - x1)) continue;
if (x4 != (c2 - x2)) continue;
if (x1 != (c1 - x3)) continue;
break;
}
if (i <= 9) {
cout << x1 << " " << x2 << endl;
cout << x3 << " " << x4 << endl;
} else
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int r1, r2, c1, c2, d1, d2;
int a, b, c, d;
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
a = (r1 - c2 + d1) / 2;
b = (c2 - r2 + d2) / 2;
c = (c1 - r1 + d2) / 2;
d = (c2 - r1 + d1) / 2;
if (a + b != r1 || a + c != c1 || a + d != d1 || b + c != d2 || b + d != c2 ||
c + d != r2 || a == b || a == c || a == d || b == c || b == d || c == d ||
a < 1 || b < 1 || c < 1 || d < 1 || a > 9 || b > 9 || c > 9 || d > 9)
printf("-1\n");
else
printf("%d %d\n%d %d\n", a, b, c, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a, b, c, d;
a = (r1 + c1 - d2);
if (a % 2 != 0) {
cout << "-1" << endl;
return 0;
} else {
a = a / 2;
}
b = r1 - a;
c = c1 - a;
d = c2 - b;
if (c + d == r2 && a + d == d1 && a != b && a != c && a != d && b != c &&
b != d && c != d && a > 0 && a < 10 && b > 0 && b < 10 && c > 0 &&
c < 10 && d > 0 && d < 10) {
cout << a << " " << b << endl << c << " " << d << endl;
} else {
cout << "-1 " << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T Multiply(T a, T b) {
return a * b;
}
template <class T>
T larger(T a, T b) {
return (a > b ? a : b);
}
template <class T>
T smaller(T a, T b) {
return (a < b ? a : b);
}
template <class T>
T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
return (a * b) / gcd(a, b);
}
template <class T>
string converter(T n) {
stringstream x;
x << n;
return x.str();
}
template <class T1>
void deb(T1 e1) {
cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
<< endl;
}
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
in >> a.first >> a.set<char>;
return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
out << a.first << " " << a.set<char>;
return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
if (b > a) a = b;
return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
if (b < a) a = b;
return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
void solve() {
int r1, r2, c1, c2, d1, d2;
scanf("%d %d\n%d %d\n%d %d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int a = 9; a > 0; a--) {
for (int b = 9; b > 0; b--) {
for (int c = 9; c > 0; c--) {
for (int d = 9; d > 0; d--) {
if (a != b && a != c && a != d && b != c && b != d && c != d &&
r1 == a + b && r2 == c + d && c1 == a + c && c2 == b + d &&
d1 == a + d && d2 == b + c) {
printf("%d %d\n%d %d\n", a, b, c, d);
return;
}
}
}
}
}
deb(-1);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d %d", &r1, &r2);
scanf("\n");
scanf("%d %d", &c1, &c2);
scanf("\n");
scanf("%d %d", &d1, &d2);
int used[10] = {0};
for (int LT = 1; LT <= 9; LT++) {
used[LT] = 1;
int RT = r1 - LT;
if (used[RT] || RT > 9 || RT < 1) {
used[LT] = 0;
continue;
}
used[RT] = 1;
int LB = c1 - LT;
int RB = c2 - RT;
if (used[LB] || used[RB] || LB == RB || RB > 9 || RB < 1 || LB > 9 ||
LB < 1) {
used[LT] = 0;
used[RT] = 0;
continue;
}
used[LB] = 1;
used[RB] = 1;
if (LT + RB == d1 && LB + RT == d2 && LB + RB == r2 && LT + LB == c1 &&
RT + RB == c2) {
printf("%d %d\n", LT, RT);
printf("%d %d", LB, RB);
return 0;
} else {
used[LT] = 0;
used[RT] = 0;
used[LB] = 0;
used[RB] = 0;
}
}
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2;
cin >> c1 >> c2;
cin >> d1 >> d2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= 9; k++) {
for (int l = 1; l <= 9; l++) {
if (i != j && i != k && i != l && j != k && j != l && k != l) {
if (i + j == c1 && k + l == c2 && i + k == r1 && j + l == r2 &&
i + l == d1 && k + j == d2) {
cout << i << " " << k << "\n" << j << " " << l << "\n";
return 0;
}
}
}
}
}
}
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a, b, c, d;
c = c1 + d2 - r1;
c /= 2;
a = c1 - d2 + r1;
a /= 2;
b = r1 - a;
d = d1 - a;
vector<int> x;
x.push_back(a);
x.push_back(b);
x.push_back(c);
x.push_back(d);
sort(x.begin(), x.end());
for (int i = 0; i < 3; i++) {
if (x[i] == x[i + 1] || x[i] > 9 || x[i + 1] > 9) {
cout << -1 << endl;
return 0;
}
}
if (a <= 0 || b <= 0 || c <= 0 || d <= 0) {
cout << -1 << endl;
return 0;
}
if (a + b == r1 && a + c == c1 && a + d == d1 && b + c == d2 && d + b == c2 &&
c + d == r2) {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
} else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool within(signed short s) { return s >= 1 && s <= 9; }
int main() {
ios_base::sync_with_stdio(0);
signed short r1, r2, c1, c2, d1, d2, a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
d = (d1 - r1 + c2) / 2;
if (d * 2 != d1 - r1 + c2) {
cout << -1;
return 0;
}
b = c2 - d;
a = d1 - d;
c = c1 - a;
map<signed short, signed short> m;
m[a]++;
m[b]++;
m[c]++;
m[d]++;
if (m.size() == 4 && within(a) && within(b) && within(c) && within(d) &&
d1 == a + d && d2 == b + c && r1 == a + b && r2 == c + d && c1 == a + c &&
c2 == b + d)
cout << a << " " << b << endl << c << " " << d;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c2, c1, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (i == j) continue;
for (int k = 1; k <= 9; k++) {
if (k == i || k == j) continue;
for (int l = 1; l <= 9; l++) {
if (l == i || l == j || l == k) continue;
if (i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && j + k == d2) {
cout << i << " " << j << endl;
cout << k << " " << l << endl;
return 0;
}
}
}
}
}
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, a, b, c, d;
while (cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2) {
int i, j, k, m;
bool flag = 0;
for (i = 1; i <= 9; ++i)
for (j = 1; j <= 9; ++j)
for (k = 1; k <= 9; ++k)
for (m = 1; m <= 9; ++m)
if (i + j == r1 && k + m == r2 && i + k == c1 && j + m == c2 &&
i + m == d1 && j + k == d2 &&
(i != j && i != k && i != m && j != k && j != m && k != m)) {
flag = 1;
goto loop;
}
loop:
if (flag) {
printf("%d %d\n%d %d\n", i, j, k, m);
} else
puts("-1");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int ans[4];
int res[4];
bool Find;
bool calc() {
if (ans[0] + ans[1] != r1) return false;
if (ans[2] + ans[3] != r2) return false;
if (ans[0] + ans[2] != c1) return false;
if (ans[1] + ans[3] != c2) return false;
if (ans[0] + ans[3] != d1) return false;
if (ans[1] + ans[2] != d2) return false;
for (int i = 0; i < 4; i++) {
res[i] = ans[i];
}
return true;
}
void dfs(int bit) {
if (Find) return;
if (bit == 4) {
if (calc()) Find = true;
return;
}
for (int i = 1; i <= 9; i++) {
ans[bit] = i;
dfs(bit + 1);
}
}
int main() {
while (~scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2)) {
Find = false;
dfs(0);
if (Find) {
if (res[0] != res[1] && res[0] != res[2] && res[0] != res[3] &&
res[1] != res[2] && res[1] != res[3] && res[2] != res[3]) {
printf("%d %d\n", res[0], res[1]);
printf("%d %d\n", res[2], res[3]);
} else {
printf("-1\n");
}
} else {
printf("-1\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r, c, d, a, b, R, C, D, A, B;
int main() {
cin >> r >> R >> c >> C >> d >> D;
a = (r + c - D) / 2;
A = (r + C - d) / 2;
b = (R + c - d) / 2;
B = (R + C - D) / 2;
if (a > 0 && b > 0 && A > 0 && B > 0 && a < 10 && A < 10 && b < 10 &&
B < 10 && a != b && b != B && B != A && A != a && A != b && a != B &&
b + B == R && A + B == C && b + A == D)
cout << a << " " << A << endl << b << " " << B;
else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a = (d1 + c1 - r2) / 2;
int b = (d2 + c2 - r2) / 2;
int c = c1 - a;
int d = c2 - b;
int x = 0;
if (a + b == r1) x++;
if (c + d == r2) x++;
if (a + c == c1) x++;
if (b + d == c2) x++;
if (a + d == d1) x++;
if (b + c == d2) x++;
int p = min({a, b, c, d});
int q = max({a, b, c, d});
if (p < 1 || q > 9) {
cout << "-1" << endl;
return 0;
}
if (x != 6 || a == b || b == c || c == d || d == a || a == c || b == d)
cout << "-1" << endl;
else {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const int maxn = 100005;
int a[4];
bool vis[10];
int r1, r2, c1, c2, d1, d2;
bool check() {
if (r1 != a[0] + a[1]) return 0;
if (r2 != a[2] + a[3]) return 0;
if (c1 != a[0] + a[2]) return 0;
if (c2 != a[1] + a[3]) return 0;
if (d1 != a[0] + a[3]) return 0;
if (d2 != a[1] + a[2]) return 0;
return 1;
}
bool dfs(int d, int x) {
if (d) a[d - 1] = x, vis[x] = 1;
if (d == 4) {
if (check()) return 1;
vis[x] = 0;
return 0;
}
for (int i = 1; i <= 9; i++)
if (!vis[i])
if (dfs(d + 1, i)) return 1;
vis[x] = 0;
return 0;
}
int main() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool f = dfs(0, 0);
if (f)
printf("%d %d\n%d %d\n", a[0], a[1], a[2], a[3]);
else
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
long long cnt = 0;
for (long long i = 1; i < 10; i++) {
for (long long j = 1; j < 10; j++) {
for (long long k = 1; k < 10; k++) {
for (long long l = 1; l < 10; l++) {
if (i != j && i != k && i != l && j != k && j != l && k != l) {
if ((i + j == r1) && (k + l == r2) && (i + k == c1) &&
(j + l == c2) && (i + l == d1) && (j + k == d2)) {
cout << i << " " << j << endl;
cout << k << " " << l << endl;
cnt++;
}
}
}
}
}
}
if (cnt == 0) {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a, b, c, d;
a = (d1 + c1 - r2) / 2;
b = r1 - a;
c = c1 - a;
d = c2 - b;
if (a != b && a != c && a != d && b != c && b != d && c != d && a <= 9 &&
b <= 9 && c <= 9 && d <= 9 && a + d == d1 && b + c == d2 && a && b && c &&
d) {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int change(int n) {
int p = 1;
while (p * 2 <= n) {
p *= 2;
}
return p;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int a = 1; a <= 9; ++a) {
for (int b = 1; b <= 9; ++b) {
for (int c = 1; c <= 9; ++c) {
for (int d = 1; d <= 9; ++d) {
if (a + b == r1 && c + d == r2 && a + c == c1 && b + d == c2 &&
a + d == d1 && b + c == d2 && a != b && a != c && a != d &&
b != c && b != d && c != d) {
cout << a << " " << b << "\n" << c << " " << d;
return 0;
}
}
}
}
}
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
long long num1, num2, num3, num4;
int f = 0;
for (num1 = 1; num1 <= 9; num1++) {
for (num2 = 1; num2 <= 9; num2++) {
if (num2 == num1) continue;
for (num3 = 1; num3 <= 9; num3++) {
if (num3 == num1 || num3 == num2) continue;
for (num4 = 1; num4 <= 9; num4++) {
if (num4 == num1 || num4 == num2 || num4 == num3) continue;
if (num1 + num2 == r1 && num3 + num4 == r2 && num1 + num3 == c1 &&
num2 + num4 == c2 && num1 + num4 == d1 && num2 + num3 == d2) {
f = 1;
break;
}
}
if (f) break;
}
if (f) break;
}
if (f) break;
}
if (f) {
cout << num1 << " " << num2 << "\n";
cout << num3 << " " << num4;
} else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[2][2];
long long r1, r2, c1, c2, d1, d2;
bool check(long long n) {
arr[0][0] = n;
arr[1][1] = d1 - n;
arr[0][1] = c2 - arr[1][1];
arr[1][0] = d2 - arr[0][1];
for (long long i = 0; i < 2; i++) {
for (long long j = 0; j < 2; j++) {
if (arr[i][j] <= 0 or arr[i][j] > 9) return false;
}
}
long long cnt = 0;
if (r1 == (arr[0][0] + arr[0][1])) cnt++;
if (r2 == (arr[1][0] + arr[1][1])) cnt++;
if (c1 == (arr[0][0] + arr[1][0])) cnt++;
if (c2 == (arr[0][1] + arr[1][1])) cnt++;
if (d1 == (arr[0][0] + arr[1][1])) cnt++;
if (d2 == (arr[1][0] + arr[0][1])) cnt++;
if (cnt != 6) return false;
set<long long> s;
for (long long i = 0; i < 2; i++) {
for (long long j = 0; j < 2; j++) {
s.insert(arr[i][j]);
}
}
if (s.size() == 4)
return true;
else
return false;
}
int32_t main() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool flag = false;
for (long long i = 1; i <= 9; i++) {
memset(arr, 0, sizeof(arr));
flag = check(i);
if (flag == true) break;
}
if (flag) {
for (long long i = 0; i < 2; i++) {
for (long long j = 0; j < 2; j++) {
cout << arr[i][j] << " ";
}
cout << endl;
}
} else
cout << "-1" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool fun(int a) {
if (a > 0 && a < 10)
return true;
else
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a[4];
a[0] = (r1 + d1 - c2) / 2;
a[1] = (c2 + r1 - d1) / 2;
a[2] = c1 - a[0];
a[3] = c2 - a[1];
int k = r1 + r2, l = d1 + d2, m = c1 + c2;
if (k == l && l == m && a[0] != a[1] && a[1] != a[2] && a[2] != a[3] &&
a[1] != a[3] && a[0] != a[3] && a[0] != a[2] && fun(a[0]) && fun(a[1]) &&
fun(a[2]) && fun(a[3])) {
cout << a[0] << " " << a[1] << endl;
cout << a[2] << " " << a[3] << endl;
} else
cout << "-1" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
long long int r1, r2, c1, c2, d1, d2, first = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
long long int val = r1 + r2 + c1 + c2 + d1 + d2;
if (val % 3 != 0) {
cout << "-1";
exit(0);
}
val /= 3;
long long int a = 0, b = 0, c = 0, d = 0;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
for (c = 1; c <= 9; c++) {
for (d = 1; d <= 9; d++) {
if (a + b == r1 && c + d == r2 && a + c == c1 && b + d == c2 &&
a + d == d1 && b + c == d2) {
if (a != b && a != c && a != d && b != c && b != d && c != d) {
first = 1;
cout << a << " " << b << "\n" << c << " " << d;
}
}
}
}
}
}
if (first == 0) {
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, r1, r2, c1, c2, d1, d2, a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool ch = false;
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
for (k = 1; k <= 9; k++) {
for (l = 1; l <= 9; l++) {
a = i;
b = j;
c = k;
d = l;
set<int> st;
st.insert(a);
st.insert(b);
st.insert(c);
st.insert(d);
if ((a + b == r1 && c + d == r2 && a + c == c1 && b + d == c2 &&
a + d == d1 && b + c == d2) &&
st.size() == 4) {
ch = true;
break;
}
}
if (ch) break;
}
if (ch) break;
}
if (ch) break;
}
if (ch) {
cout << a << ' ' << b << endl;
cout << c << ' ' << d << endl;
} else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long tt, a1, a2 = 1000000000000, a3, a4, a5, a6, a7, a8, a9, ez1, ans, n,
m, k, sum;
int ul, ur, dl, dr;
string s, s1, s2, s3;
int flag[30];
bool omm(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
void input() {
cin >> a1 >> a2;
cin >> a3 >> a4;
cin >> a5 >> a6;
}
void solve() {
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
for (int k = 1; k < 10; k++)
for (int l = 1; l < 10; l++)
if (i + j == a1 && i + k == a3 && i + l == a5 && j + l == a4 &&
j + k == a6 && l + k == a2 && i != j && i != k && i != l &&
j != k && j != l && l != k) {
cout << i << ' ' << j << endl << k << ' ' << l << endl;
return;
}
cout << -1 << endl;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i < 10; i++) {
a = i;
b = r1 - i;
if (c1 - a == d2 - b)
c = c1 - a;
else
continue;
if (r2 - c == d1 - a && d1 - a == c2 - b) {
d = r2 - c;
if (a == b || b == c || c == d || d == a || a == c || b == d || a >= 10 ||
b >= 10 || c >= 10 || d >= 10 || a < 1 || b < 1 || c < 1 || d < 1)
continue;
cout << a << " " << b << endl << c << " " << d << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x0, x1, y0, y1;
int in1, in2, in3, in4, in5, in6;
scanf("%d%d%d%d%d%d", &in1, &in2, &in3, &in4, &in5, &in6);
x0 = (in3 + in5 - in2) / 2;
x1 = in3 - x0;
y0 = in1 - x0;
y1 = in5 - x0;
if (x0 <= 0 || x1 <= 0 || y0 <= 0 || y1 <= 0) {
printf("-1");
return 0;
}
int arr[4];
arr[0] = x0;
arr[1] = x1;
arr[2] = y0;
arr[3] = y1;
if (x0 >= 10 || x0 <= 0 || x1 >= 10 || x1 <= 0 || y0 >= 10 || y0 <= 0 ||
y1 >= 10 || y1 <= 0) {
printf("-1");
return 0;
}
for (int(i) = (0); (i) < (4); (i)++) {
for (int(j) = (i + 1); (j) < (4); (j)++) {
if (arr[i] == arr[j]) {
printf("-1");
return 0;
}
}
}
printf("%d %d\n%d %d", x0, y0, x1, y1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
const double PI = acos(-1.0);
const long long mod = 1e18;
const int maxn = 100000 + 5;
const int N = 10000 + 5;
int r1, r2, c1, c2, d1, d2;
int x, y, z, w;
int infer(int n) {
if (n > 0 && n < 10) return 1;
return 0;
}
int ck(int a, int b, int c, int d) {
if (a == b || a == c || a == d) return 0;
if (b == c || b == d) return 0;
if (c == d) return 0;
return 1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool flag = false;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
x = i, y = j;
w = d1 - x, z = d2 - y;
if (infer(z) && infer(w)) {
if (x + y == r1 && z + w == r2 && x + z == c1 && y + w == c2 &&
ck(x, y, z, w)) {
flag = true;
break;
}
}
}
if (flag) break;
}
if (flag)
cout << x << " " << y << endl << z << " " << w << endl;
else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10];
for (int i = 0; i < 6; i++) scanf("%d", &a[i]);
bool f = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (j == i) continue;
for (int k = 1; k <= 9; k++) {
if (k == i || k == j) continue;
for (int m = 1; m <= 9; m++) {
if (m == i || m == j || m == k) continue;
if ((i + j == a[0]) && (k + m == a[1]) && (i + k == a[2]) &&
(j + m == a[3]) && (i + m == a[4]) && (j + k == a[5])) {
f = 1;
printf("%d %d\n%d %d\n", i, j, k, m);
break;
}
}
}
}
}
if (!f) printf("-1\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
void fun() {
int val1, val2, val3, val4;
for (int i = 1; i < 10; i++) {
val1 = i;
val2 = r1 - val1;
val3 = c1 - val1;
val4 = c2 - val2;
if (val1 == val2 || val1 == val3 || val1 == val4 || val2 == val3 ||
val3 == val4 || val3 == val4 || val2 == val4 || val1 < 1 || val2 < 1 ||
val3 < 1 || val4 < 1 || val1 > 9 || val2 > 9 || val3 > 9 || val4 > 9)
continue;
if (val1 + val2 == r1 && val1 + val3 == c1 && val1 + val4 == d1 &&
val2 + val3 == d2 && val2 + val4 == c2 && val3 + val4 == r2) {
cout << val1 << " " << val2 << endl << val3 << " " << val4 << endl;
return;
}
}
cout << -1 << endl;
return;
}
int main() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
fun();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int c1, c2, d1, d2, r1, r2, i, j, k, l, f = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (i = 1; i < 10; i++) {
for (j = 1; j < 10; j++) {
if (j != i)
for (k = 1; k < 10; k++) {
if (k != j && k != i)
for (l = 1; l < 10; l++) {
if (l != k && l != j && l != i)
if (i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && j + k == d2) {
f = 1;
break;
}
}
if (f) break;
}
if (f) break;
}
if (f) break;
}
if (f)
cout << i << " " << j << endl << k << " " << l;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, x, y, z, a, b, c1, c2, d1, d2;
cin >> a >> b;
cin >> c1 >> c2;
cin >> d1 >> d2;
y = (c2 + d1 - a) / 2;
z = b - y;
w = c2 - y;
x = c1 - z;
if (w == x || w == y || w == z || x == y || x == z || y == z || w < 1 ||
x < 1 || y < 1 || z < 1 || w > 9 || x > 9 || y > 9 || z > 9)
cout << "-1" << endl;
else
cout << x << " " << w << endl << z << " " << y << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.