solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
# cook your dish here
t=int(input())
while t>0 :
n=int(input())
for i in range(n) :
l=input()
if i==0 :
a=l[1]
if i==1 :
b=l[0]
if i==n-2 :
c=l[-1]
if i==n-1 :
d=l[-2]
if a==b and c==d :
if a!=c :
print(0)
else :
print(2)
print(1,2)
print(2,1)
else :
if a==b :
print(1)
if c!=a :
print(n,n-1)
else :
print(n-1,n)
elif c==d :
print(1)
if a!=c :
print(2,1)
else :
print(1,2)
else :
print(2)
if a=='1' :
print(2,1)
else :
print(1,2)
if c=='0' :
print(n,n-1)
else :
print(n-1,n)
t-=1
| 8 |
PYTHON3
|
t=int(input())
for _ in range(t):
n=int(input())
l=[]
for i in range(n):
l.append(input())
a,b=l[0][1],l[1][0]
x,y=l[n-1][n-2],l[n-2][n-1]
if a==b:
ans=0
k=[]
if x==a:
k.append([n-1+1,n-2+1])
ans+=1
if y==a:
k.append([n-2+1,n-1+1])
ans+=1
print(ans)
for i in k:
print(*i)
elif x==y:
ans=0
k=[]
if x==a:
k.append([1,2])
ans+=1
if y==b:
k.append([2,1])
ans+=1
print(ans)
for i in k:
print(*i)
else:
ans=0
k=[]
if a=='0':
k.append([1,2])
ans+=1
if b=='0':
k.append([2,1])
ans+=1
if x=='1':
k.append([n-1+1,n-2+1])
ans+=1
if y=='1':
k.append([n-2+1,n-1+1])
ans+=1
print(ans)
for i in k:
print(*i)
| 8 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
char s[400][400];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
int one = 0, zero = 0;
if (s[1][2] == '1')
one++;
else
zero++;
if (s[2][1] == '1')
one++;
else
zero++;
if (one == 0) {
int tot = 0, s1 = 0, s2 = 0;
if (s[n][n - 1] == '0') tot++, s1 = 1;
if (s[n - 1][n] == '0') tot++, s2 = 1;
printf("%d\n", tot);
if (s1) printf("%d %d\n", n, n - 1);
if (s2) printf("%d %d\n", n - 1, n);
} else if (one == 1) {
int o = 0, z = 0;
if (s[n][n - 1] == '1')
o++;
else
z++;
if (s[n - 1][n] == '1')
o++;
else
z++;
if (o == 1) {
printf("2\n");
if (s[1][2] == '1') printf("1 2\n");
if (s[2][1] == '1') printf("2 1\n");
if (s[n][n - 1] == '0') printf("%d %d\n", n, n - 1);
if (s[n - 1][n] == '0') printf("%d %d\n", n - 1, n);
} else if (o == 0) {
printf("1\n");
if (s[1][2] == '0') printf("1 2\n");
if (s[2][1] == '0') printf("2 1\n");
} else {
printf("1\n");
if (s[1][2] == '1') printf("1 2\n");
if (s[2][1] == '1') printf("2 1\n");
}
} else {
int tot = 0, s1 = 0, s2 = 0;
if (s[n][n - 1] == '1') tot++, s1 = 1;
if (s[n - 1][n] == '1') tot++, s2 = 1;
printf("%d\n", tot);
if (s1) printf("%d %d\n", n, n - 1);
if (s2) printf("%d %d\n", n - 1, n);
}
}
}
| 8 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
short l = 0;
bool b = 0;
vector<vector<short>> v(3);
for (int i = 0; i < 3; i++)
for (int j = 0; j < 2; j++) {
cin >> l;
v[i].push_back(l);
}
short x = (v[2][1] - v[0][1] + v[1][1]) / 2;
short a[4];
a[0] = v[0][0] - x;
a[1] = x;
a[2] = v[0][1] - v[1][1] + x;
a[3] = v[1][1] - x;
for (int i = 0; i < 4; i++)
for (int j = i + 1; j < 4; j++) {
if (a[i] == a[j]) {
b = 1;
j = 4;
i = 4;
}
}
for (int i = 0; i < 4; i++) {
if (a[i] < 1 || a[i] > 9) {
b = 1;
i = 4;
}
}
if (a[2] + a[0] != v[1][0]) b = 1;
if (b)
cout << -1 << endl;
else {
cout << a[0] << " " << a[1] << endl;
cout << a[2] << " " << a[3] << endl;
}
return 0;
}
| 7 |
CPP
|
inn = list(map(int, input().split(" ")))
r1 = inn[0]
r2 = inn[1]
inn = list(map(int, input().split(" ")))
c1 = inn[0]
c2 = inn[1]
inn = list(map(int, input().split(" ")))
d1 = inn[0]
d2 = inn[1]
x = int((d1+c1-r2)/2)
y = int(((2*r1)-d1-c1+r2)/2)
a = int(((2*c1)-d1-c1+r2)/2)
b = int((r2-(2*c1)+d1+c1)/2)
if x == y or x == a or x == b or y == a or y == b or a == b or x < 1 or x > 9 or y < 1 or y > 9 or a < 1 or a > 9 or b < 1 or b > 9:
print(-1)
else:
print(x, y)
print(a, b)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
if (i + j == r1 && i != j) {
for (int k = 1; k < 10; k++) {
if (i + k == c1 && k + j == d2 && j != k && i != k) {
for (int l = 1; l < 10; l++) {
if (l + k == r2 && l + i == d1 && l != k && l != i && j != l) {
cout << i << " " << j << '\n';
cout << k << " " << l << '\n';
return;
}
}
}
}
}
}
}
cout << -1 << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
solve();
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, x, y, z, w;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (x = 1; x < 10; ++x) {
y = r1 - x;
z = c1 - x;
w = d1 - x;
if (x != y && x != z && x != w && y != z && y != w && z != w && y < 10 &&
y > 0 && z > 0 && z < 10 && w > 0 && w < 10 && z + w == r2 &&
z + y == d2 && y + w == c2) {
cout << x << " " << y << "\n" << z << " " << w;
return 0;
}
}
cout << -1;
return 0;
}
| 7 |
CPP
|
def is_magic_square(a,b,c,d,r1,r2,c1,c2,d1,d2):
return ((a+b==r1) and (c+d==r2) and (a+c==c1) and (b+d==c2) and (a+d==d1) and (b+c==d2))
r1,r2 = [int(i) for i in input().split()]
c1,c2 = [int(i) for i in input().split()]
d1,d2 = [int(i) for i in input().split()]
flag = False
for a in range(1,10):
for b in range(1,10):
for c in range(1,10):
for d in range(1,10):
if a==b or a==c or a==d or b==c or b==d or c==d:
continue
if is_magic_square(a,b,c,d,r1,r2,c1,c2,d1,d2):
flag = True
print(a,b)
print(c,d)
break
if flag:
break
if flag:
break
if flag:
break
if not(flag):
print(-1)
| 7 |
PYTHON3
|
r1, r2 = list(map(int, input().rstrip().split()))
c1, c2 = list(map(int, input().rstrip().split()))
d1, d2 = list(map(int, input().rstrip().split()))
li = [1, 2, 3, 4, 5, 6, 7, 8, 9]
flag = 0
for i in li:
a = i
c = c1 - a
b = r1 - a
d = d1 - a
if c in li and b in li and d in li:
if (b == d2 - c) and (b == c2 - d) and(c+d==r2):
flag=1
break
if a == b or a == c or a == d or b == c or b == d or c == d:
flag=0
if flag == 1:
print(a, b)
print(c, d)
else:
print(-1)
| 7 |
PYTHON3
|
r1 , r2 =map(int, input().split())
c1 , c2 = map(int, input().split())
d1 , d2 = map(int, input().split())
a = (r1 + c1 - d2) // 2
c = (c1 + r2 - d1) // 2
b = (r1 + c2 - d1) // 2
d = (r2 + c2 - d2 ) // 2
ans = a in range(1,10) and b in range(1,10) and c in range(1,10) and d in range(1,10)
eq = a != b and a != c and a != d and b != c and b != d and c != d
if d1 == a+d and d2 == b+c and r1 == a+b and r2 == c+d and c1 == a+c and c2 == b+d and ans and eq:
print(a , b)
print(c , d)
else :
print(-1)
| 7 |
PYTHON3
|
"""
author - Sayan Bose
date - 29.01.2020
Brooklyn 99 is love!
"""
from itertools import permutations
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
c = list(permutations([i for i in range(1, 10)], 4))
for i in c:
t1, t2, t3, t4 = i
if t1 + t2 == r1 and t3 + t4 == r2 and t1 + t3 == c1 and t2 + t4 == c2 and t1 + t4 == d1 and t2 + t3 == d2:
print(t1, t2)
print(t3, t4)
exit()
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
vector<int> solve(int r1, int r2, int c1, int c2, int d1, int 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 and c + d == r2 and a + c == c1 and b + d == c2 and
a + d == d1 and b + c == d2)
return {a, b, c, d};
}
return {};
}
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
auto ans = solve(r1, r2, c1, c2, d1, d2);
if (ans.empty())
cout << -1 << '\n';
else {
cout << ans[0] << ' ' << ans[1] << '\n';
cout << ans[2] << ' ' << ans[3] << '\n';
}
return 0;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
check = True
x = 0
a = 0
b = 0
c = 0
for i in range(1, 10, 1):
x = i
a = r1 - x
b = d2 - a
c = r2 - b
if 1 <= a <= 9 and 1 <= b <= 9 and 1 <= c <= 9 :
if a != b and a != c and b != c and x != a and x != b and x != c:
if (x + c) == d1 and (x + b) == c1 and (a + c) == c2:
check = False
break
if check:
print(-1)
else:
print(x, a)
print(b, c)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(nullptr), cout.tie(nullptr);
int r1, r2, c1, c2, d1, d2, s1 = 0, s2 = 0, s3 = 0, s4 = 0, s5 = 0, s6 = 0,
i = 0, j = 0, l = 0, k = 0, a = 0, b = 0, c = 0,
d = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool sqare = false;
for (i = 1; i < 10; ++i) {
for (j = 1; j < 10; ++j) {
for (k = 1; k < 10; ++k) {
for (l = 1; l < 10; ++l) {
s1 = i + j;
s2 = k + l;
s3 = i + k;
s4 = j + l;
s5 = i + l;
s6 = j + k;
if (s1 == r1 && s2 == r2 && s3 == c1 && s4 == c2 && s5 == d1 &&
s6 == d2) {
sqare = true;
a = i, b = j, c = k, d = l;
break;
}
}
}
}
}
if (sqare && a != b && a != c && a != d && b != c && b != d && c != d)
cout << a << " " << b << '\n' << c << " " << d << '\n';
else
cout << -1 << '\n';
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
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);
for (int a = 1; a <= 9; a++)
for (int b = 1; b <= 9; b++) {
if (a == b) continue;
for (int c = 1; c <= 9; c++) {
if (a == c || b == c) continue;
for (int d = 1; d <= 9; 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) {
printf("%d %d\n%d %d\n", a, b, c, d);
goto ex;
}
}
}
}
printf("-1\n");
ex:
return 0;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
a = b = c = d = -1
for a in range(1, 21):
b = r1 - a
if c1 - a is d2 - b:
c = c1 - a
else:
continue
if r2 - c is d1 - a and d1 - a is c2 - b:
d = r2 - c
else:
continue
if a is not b and a is not c and a is not d and b is not c and b is not d and c is not d and 1 <= a <= 9 and 1 <= b <= 9 and 1 <= c <= 9 and 1 <= d <= 9:
print(str(a) + " " + str(b) + "\n" + str(c) + " " + str(d))
else:
continue
exit(0)
print(-1)
| 7 |
PYTHON3
|
def arr_inp():
return [int(x) for x in input().split()]
r, c, d = [arr_inp() for i in range(3)]
C=((c[0]-d[0]+r[1])/2)
if(C!=int(C)):
exit(print(-1))
C=int(C)
D=r[1]-C
A=d[0]-D
B=r[0]-A
arr=[A,B,C,D]
if(min(arr)<1 or max(arr)>9 or A==B or A==C or A==D or B==C or B==D or C==D ):
exit(print(-1))
print(A,B)
print(C,D)
| 7 |
PYTHON3
|
from functools import reduce
r=[int(x) for x in input().split()]
c=[int(x) for x in input().split()]
d=[int(x) for x in input().split()]
ans=False
for w in range(1,10):
for x in range(1,10):
for y in range(1,10):
for z in range(1,10):
if w!=x and w!=y and w!=z and x!=y and x!=z and y!=z:
if r[0]==w+x and r[1]==y+z:
if c[0]==w+y and c[1]==x+z:
if d[0]==w+z and d[1]==x+y:
print("{} {}".format(w,x))
print("{} {}".format(y,z))
ans=True
break
if not ans:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, b1, b2, c1, c2;
cin >> a1 >> a2 >> b1 >> b2 >> c1 >> c2;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int l = 1; l <= 9; l++) {
for (int k = 1; k <= 9; k++) {
if (a1 == i + j && a2 == l + k && b1 == i + l && b2 == j + k &&
c1 == i + k && c2 == j + l && i != j && i != l && i != k &&
j != l && j != k && l != k) {
cout << i << " " << j << endl << l << " " << k << endl;
return 0;
}
}
}
}
}
cout << -1 << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
int n;
int m;
int r1, r2, c1, c2, d1, d2;
int main() {
scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2);
for (int a = 1; a <= 9; a++)
for (int b = 1; b <= 9; b++)
if (a != b)
for (int c = 1; c <= 9; c++)
if (a != c && b != c)
for (int d = 1; d <= 9; d++)
if (a != d && b != d && c != d)
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\n", a, b, c, d);
return 0;
}
printf("-1\n");
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
bool np(int x) {
if (x == 0) return 0;
if (x == 1) return 0;
if (x == 2) return 0;
if (x >= 3) {
for (int i = 2; i * i <= x; i++) {
if (i == x) continue;
if (x % i == 0) return 0;
}
}
return 1;
}
signed main() {
int y = 0, c = -1, L, n = 0, t = 0, t1 = 0, k;
int r1, r2, d1, d2, c1, c2;
int gg1, gg2, gg3, gg4;
set<char> st1;
cin >> r2;
cin >> r1;
cin >> c1;
cin >> c2;
cin >> d1;
cin >> d2;
int xm = max({r1, r2, d1, d2, c1, c2});
int xn = min({r1, r2, d1, d2, c1, c2});
bool ok = true;
{
for (int g1 = 1; g1 < 10; g1++) {
for (int g2 = 1; g2 < 10; g2++) {
for (int g3 = 1; g3 < 10; g3++) {
for (int g4 = 1; g4 < 10; g4++) {
if (g1 == g2 || g1 == g3 || g1 == g4 || g2 == g3 || g3 == g4 ||
g2 == g4)
continue;
if ((g1 + g2) == r2 && (g4 + g3) == r1 && (g1 + g3) == c1 &&
(g4 + g2) == c2 && (g1 + g4) == d1 && (g3 + g2) == d2) {
cout << g1 << " " << g2 << endl;
cout << g3 << " " << g4 << endl;
return 0;
}
}
}
}
}
}
cout << -1 << endl;
return 0;
}
| 7 |
CPP
|
# Строки
r1, r2 = map(int, input().split())
# Столбцы
c1, c2 = map(int, input().split())
# Диагонали
d1, d2 = map(int, input().split())
# x a -- уникальные
# b c
status = False
for x in range(1, 10):
a = r1 - x
c = c2 - a
b = r2 - c
count = 0
if len(set([x, a, b, c])) == 4:
count += 1
if a in range(1, 10) and b in range(1, 10) and c in range(1, 10) and x in range(1, 10):
count += 1
if x + c == d1 and a + b == d2:
count += 1
if count == 3:
status = True
break
if status:
print(x, a)
print(b, c)
else:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int used[15];
int main() {
int i, j, k, l, r1, r2, c1, c2, d1, d2;
scanf(" %d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
for (i = 1; i <= 9; i++) {
used[i] = 1;
for (j = 1; j <= 9; j++)
if (!used[j]) {
used[j] = 1;
for (k = 1; k <= 9; k++)
if (!used[k]) {
used[k] = 1;
for (l = 1; l <= 9; l++)
if (!used[l]) {
if (i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && j + k == d2) {
printf("%d %d\n%d %d\n", i, j, k, l);
return 0;
}
}
used[k] = 0;
}
used[j] = 0;
}
used[i] = 0;
}
printf("-1\n");
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
float a[4] = {0};
a[2] = (r2 + c1 - d1) / 2;
int flag = 0;
if (a[2] != floor(a[2]) || a[2] <= 0 || a[2] >= 10)
cout << -1 << endl;
else {
a[3] = r2 - a[2];
if (a[3] == a[2] || a[3] <= 0 || a[3] >= 10)
cout << -1 << endl;
else {
a[0] = d1 - a[3];
if (a[0] == a[2] || a[0] == a[3] || a[0] <= 0 || a[0] >= 10)
cout << -1 << endl;
else {
a[1] = r1 - a[0];
if (a[1] == a[0] || a[1] == a[2] || a[1] == a[3] || a[1] <= 0 ||
a[1] >= 10)
cout << -1 << endl;
else {
flag = 1;
}
}
}
}
if (flag == 1)
cout << a[0] << " " << a[1] << endl << a[2] << " " << a[3] << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool test = true;
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
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 == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
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;
test = false;
break;
}
}
}
}
}
if (test) {
cout << -1 << endl;
}
}
| 7 |
CPP
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
flag=0
for i in range(1,10):
l=[]
x1=i
y1=r1-x1
x2=c1-x1
y2=c2-y1
if(0<y1<10 and 0<x2<10 and 0<y2<10 and d1==x1+y2 and d2==x2+y1 and y2==r2-x2):
l.append(x1)
l.append(y2)
l.append(y1)
l.append(x2)
if(len(set(l))==4):
flag=1
print(x1,y1)
print(x2,y2)
break;
if(flag==0):
print("-1")
| 7 |
PYTHON3
|
#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 < 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 || i == k || i == l || j == k || j == l || k == l)
continue;
else {
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;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
long long n, caseno, r1, r2, c1, c2, d1, d2;
long long a[200005];
void ResetAll() {}
void Input() {
scanf("%lld%lld%lld%lld%lld%lld", &r1, &r2, &c1, &c2, &d1, &d2);
}
bool Ok(int a, int b, int c, int d) {
if (a + b != r1) return 0;
if (c + d != r2) return 0;
if (a + c != c1) return 0;
if (b + d != c2) return 0;
if (a + d != d1) return 0;
if (c + b != d2) return 0;
set<int> st;
st.insert(a);
st.insert(b);
st.insert(c);
st.insert(d);
if (st.size() == 4) return 1;
return 0;
}
void Calculation() {
int resa, resb, resc, resd;
bool ok = 0;
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 (Ok(a, b, c, d)) {
resa = a, resb = b, resc = c, resd = d;
ok = 1;
break;
}
}
}
}
}
if (ok) {
printf("%d %d\n%d %d\n", resa, resb, resc, resd);
} else {
puts("-1");
}
}
void Solve() {
Input();
Calculation();
ResetAll();
}
int main() {
int q;
q = 1;
caseno = 0;
while (q--) {
caseno++;
Solve();
}
return 0;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
found = False
for a in range(1,10):
for b in range(1,10):
if b != a:
for c in range(1,10):
if c != b and c != a:
for d in range(1,10):
if d != a and d !=b and d !=c:
if r1 == a+b and r2 == c+d and c1 == a+c and c2 == b+d and d1 ==a+d and d2 == b+c:
print(a,b)
print(c,d)
found = True
break
if not found:
print(-1)
| 7 |
PYTHON3
|
r1, r2 = [int(x) for x in input().split()]
c1, c2 = [int(x) for x in input().split()]
d1, d2 = [int(x) for x in input().split()]
x2 = (c2 + r1 - d1)//2
x1 = r1 - x2
y1 = d2 - x2
y2 = c2 - x2
if 1 <= x1 <= 9 and 1 <= x2 <= 9 and 1 <= y1 <= 9 and 1 <= y2 <= 9 and x1 != x2 and y1 != y2 and x1 != y1 and x1 != y2 and x2 != y1 and x2 != y2 and x1+x2 == r1 and y1+y2 == r2 and x1+y1 == c1 and x2+y2 == c2 and x1+y2 == d1 and y1+x2 == d2:
print(x1, x2)
print(y1, y2)
else:
print(-1)
| 7 |
PYTHON3
|
#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);
int flag = 0;
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) {
printf("%d %d\n", a, b);
printf("%d %d\n", c, d);
flag = 1;
break;
}
}
}
}
}
if (flag != 1) printf("-1\n");
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
char sl = '\n';
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
pair<int, int> r, c, d;
cin >> r.first >> r.second;
cin >> c.first >> c.second;
cin >> d.first >> d.second;
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)
continue;
if (i + j == r.first && k + t == r.second && i + k == c.first &&
j + t == c.second && i + t == d.first && j + k == d.second) {
cout << i << " " << j << sl;
cout << k << " " << t << sl;
return 0;
}
}
}
}
}
cout << -1 << sl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool ok = false;
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
do {
if (a[0] + a[1] == r1 && a[2] + a[3] == r2 && a[0] + a[2] == c1 &&
a[1] + a[3] == c2 && a[0] + a[3] == d1 && a[1] + a[2] == d2) {
ok = true;
break;
}
} while (next_permutation(a, a + 9));
if (ok)
cout << a[0] << ' ' << a[1] << endl << a[2] << ' ' << a[3] << endl;
else
cout << -1 << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
int main() {
int r1, r2, d1, d2, c1, c2, a, b, c, d;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
a = (c1 + d1 - r2) / 2;
b = c1 - a;
c = r1 - a;
d = r2 - b;
if (a != b && a != c && a != d && b != c && b != d && c != d && a && b && c &&
d && a <= 9 && b <= 9 && c <= 9 && d <= 9)
printf("%d %d\n%d %d", a, c, b, d);
else
printf("-1");
}
| 7 |
CPP
|
r1, r2 = list(map(int, input().split()))
c1, c2 = list(map(int, input().split()))
d1, d2 = list(map(int, input().split()))
r1_contender = []
r2_contender = []
for i in range(1, 10):
for j in range(1, 10):
if i+j == r1 and i != j:
r1_contender.append([i,j])
r1_contender.append([j,i])
if i+j == r2 and i != j:
r2_contender.append([i,j])
r2_contender.append([j,i])
found = False
for first_row in r1_contender:
for second_row in r2_contender:
colum1_match = (first_row[0] + second_row[0]) == c1
colum2_match = (first_row[1] + second_row[1]) == c2
diagnol1_match = (first_row[0] + second_row[1]) == d1
diagnol2_match = (first_row[1] + second_row[0]) == d2
if colum1_match and colum2_match and diagnol1_match and diagnol2_match and first_row[0] not in second_row and first_row[1] not in second_row:
found=True
print(' '.join(list(map(str, first_row))))
print(' '.join(list(map(str, second_row))))
break
if found:
break
if not found:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int a[111111], b[111111], n, k, i, j, p, f[111111], w, ans, m1, m2, m3, m4, m5,
m6, q, z, x, y;
int main() {
cin >> m1 >> m2 >> m3 >> m4 >> m5 >> m6;
if ((m2 + m3 + m5) % 2 == 0 && m3 <= (m2 + m3 + m5) / 2)
q = (m2 + m3 + m5) / 2 - m3;
else {
cout << "-1";
return 0;
}
x = m5 - q;
y = m1 - x;
z = m3 - x;
if (x > 0 && y > 0 && z > 0 && q > 0 && x != y && y != z && x != q &&
x != z && y != q && z != q && x <= 9 && y <= 9 && z <= 9 && q <= 9)
cout << x << " " << y << endl << z << " " << q;
else
cout << "-1";
cin >> n;
}
| 7 |
CPP
|
m=input()
n=input()
o=input()
r1,r2=m.split(" ")
c1,c2=n.split(" ")
d1,d2=o.split(" ")
x=int((int(r1)+int(d1)-int(c2))/2)
w=int((int(r2)+int(d2)-int(c2))/2)
y=int((int(r1)+int(d2)-int(c1))/2)
z=int((int(r2)+int(d1)-int(c1))/2)
a=int(r1)+int(r2)
b=int(c1)+int(c2)
c=int(d1)+int(d2)
if x==y or y==z or z==w or w==x or y==w or x==z:
print(-1)
elif x>9 or y>9 or w>9 or z>9 or x<1 or y<1 or w<1 or z<1:
print(-1)
elif a!=b or b!=c or c!=a:
print(-1)
else:
print(str(x)+" "+str(y))
print(str(w)+" "+str(z))
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)(1e5) + 123;
const long long inf = (long long)(1e18);
const int INF = (int)(1e9);
int r1, r2, d1, d2, c1, c2;
int main() {
ios_base::sync_with_stdio(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 t = 1; t <= 9; ++t)
if (i != j && j != k && i != k && k != t && j != t && i != t)
if (i + k == c1 && j + t == c2 && i + j == r1 && k + t == r2 &&
i + t == d1 && j + k == d2) {
cout << i << " " << j << "\n" << k << " " << t;
return 0;
}
cout << "-1";
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a11 = (r1 + c1 - d2) / 2;
int a12 = r1 - a11;
int a21 = c1 - a11;
int a22 = d1 - a11;
if (a11 != a12 && a11 != a21 && a11 != a22 && a12 != a21 && a12 != a22 &&
a21 != a22 && 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;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int a[N];
int main() {
int r1, r2, c1, c2, d1, d2;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
int x, y, z, w;
if ((r1 - c1 + d2) % 2 != 0 || (r1 - c1 + d2 <= 0)) {
printf("-1\n");
return 0;
} else {
y = (r1 - c1 + d2) / 2;
}
if (d2 - y <= 0) {
printf("-1\n");
return 0;
} else
z = d2 - y;
if (r2 - z <= 0) {
printf("-1\n");
return 0;
} else {
w = r2 - z;
}
if (r1 - y <= 0) {
printf("-1\n");
return 0;
} else {
x = r1 - y;
}
if (x + y == r1 && x + z == c1 && z + w == r2 && y + w == c2 && x + w == d1 &&
y + z == d2) {
if (x <= 9 && y <= 9 && z <= 9 && w <= 9 && x != y && x != z && x != w &&
y != z && y != w && z != w)
printf("%d %d\n%d %d\n", x, y, z, w);
else
printf("-1\n");
} else {
printf("-1\n");
return 0;
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
int main() {
int r1, r2, c1, c2, d1, d2, x1, x2, y1, y2, flag = 0;
scanf("%d %d %d %d %d %d", &r1, &r2, &c1, &c2, &d1, &d2);
for (x1 = 1; x1 <= 9; ++x1)
for (x2 = 1; x2 <= 9; ++x2)
for (y1 = 1; y1 <= 9; ++y1)
for (y2 = 1; y2 <= 9; ++y2) {
if (x1 + x2 == c1 && x2 + y2 == r2 && x1 + y1 == r1 &&
y1 + y2 == c2 && x1 + y2 == d1 && y1 + x2 == d2 && x1 != y1 &&
y1 != x2 && x2 != y2 && x1 != x2 && x1 != y2 && y1 != y2) {
flag = 1;
printf("%d %d\n%d %d\n", x1, y1, x2, y2);
break;
}
}
if (!flag) puts("-1");
return 0;
}
| 7 |
CPP
|
def main():
from itertools import permutations
r1, r2, c1, c2, d1, d2 = (int(s) for _ in (1, 2, 3) for s in input().split())
for a, b, c, d in permutations(range(1, 10), 4):
if a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2:
print(a, b)
print(c, d)
break
else:
print(-1)
if __name__ == '__main__':
main()
| 7 |
PYTHON3
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
a=(r1+c1-d2)//2
b=r1-a
c=c1-a
d=c2-b
if a+d==d1 and b+c==d2 and a+b==r1 and c+d==r2 and a+c==c1 and b+d==c2 and len(set([a,b,c,d]))==4 and max(a,b,c,d)<10 and min(a,b,c,d)>0:
print(a,b)
print(c,d)
else:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, i, j, k, l, flag = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
for (k = 1; k <= 9; k++) {
for (l = 1; l <= 9; l++) {
if (i + k == r1 and i + j == c1 and j + l == r2 and k + l == c2 and
k + j == d2 and i + l == d1) {
if (i != j and i != k and i != l and j != k and j != l and k != l) {
flag = 1;
cout << i << " " << k << endl;
cout << j << " " << l;
break;
}
}
}
}
}
}
if (flag == 0) {
cout << -1;
}
}
| 7 |
CPP
|
r1,r2 = map(int,input().split())
c1,c2 = map(int,input().split())
d1,d2 = map(int,input().split())
c = abs(r1-c1-d2)//2
b = abs(r2-c2-d2)//2
a = abs(r1-b)
d = abs(c2-b)
res = [a,b,c,d]
if a+b != r1 or c+d != r2 or a+d != d1 or b+c != d2:
print(-1)
else:
for i in range(4):
if res.count(res[i])>1 or res[i] >9 or res[i] < 1:
print(-1)
break
else:
print(a,b)
print(c,d)
| 7 |
PYTHON3
|
lt=list(input().split())
r1,r2=int(lt[0]),int(lt[1])
lt=list(input().split())
c1,c2=int(lt[0]),int(lt[1])
lt=list(input().split())
d1,d2=int(lt[0]),int(lt[1])
Sw=0
for i00 in range(1,10):
for i01 in range(1,10):
if i00==i01:
continue
for i10 in range(1,10):
if i10==i01 or i10==i00:
continue
for i11 in range(1,10):
if i11==i10 or i11==i01 or i11==i00:
continue
if i00+i01==r1 and i10+i11==r2 and i00+i11==d1 and i01+i10==d2 and i00+i10==c1 and i01+i11==c2:
Sw=1
print(i00,i01)
print(i10,i11)
if Sw==0:
print(-1)
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
tl, tr ,bl, br = 0,0,0,0
satisfied = False
counter = 1
if max(r1,r2,c1,c2,d1,d2) > 8+9:
counter = 10
while (counter < 10 and not satisfied):
tl = counter
tr = r1 - tl
bl = c1 - tl
br = d1 - tl
if (r2 == bl + br and c2 == tr + br and d2 == bl + tr and len({tl,tr,bl,br}) == 4
and 0<tr<10 and 0<bl<10 and 0<br<10):
satisfied = True
counter+=1
if satisfied:
print(tl, tr, '\n'+str(bl), br)
else:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2, A, B, C, D;
int main() {
scanf("%d%d%d%d%d%d", &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 == r1 && C + D == r2 && A + C == c1 && B + D == c2 &&
A + D == d1 && B + C == d2) {
set<int> s;
s.insert(A);
s.insert(B);
s.insert(C);
s.insert(D);
if (s.size() == 4) {
printf("%d %d\n%d %d\n", A, B, C, D);
return 0;
}
}
puts("-1");
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2, flag = 0;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
if (r1 >= 18 || r2 >= 18 || c1 >= 18 || c2 >= 18 || d1 >= 18 || d2 >= 18) {
} else {
int wc, xc, yc, zc;
for (int w = 1; w < 10; w++) {
wc = w;
int x = r1 - w;
xc = x;
if (x <= 9 && w != x) {
for (int z = 1; (z < 10); z++) {
zc = z;
if (z != x && z != w && (x + z == d2) && (w + z == c1)) {
int y = r2 - z;
yc = y;
if (y <= 9 && y != z && y != x && y != w) {
if (w + y == d1 && x + y == c2) {
flag = 1;
cout << w << " " << x << "\n";
cout << z << " " << y << "\n";
break;
}
}
}
}
}
}
}
if (flag == 0) cout << "-1\n";
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int a[6];
vector<int> v;
int main() {
for (int i = 0; i < 6; i++) scanf("%d", &a[i]);
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 == a[0] && k + l == a[1] && i + k == a[2] &&
j + l == a[3] && i + l == a[4] && j + k == a[5]) {
v.clear();
v.push_back(i);
v.push_back(j);
v.push_back(k);
v.push_back(l);
sort(v.begin(), v.end());
vector<int>::iterator it;
it = unique(v.begin(), v.end());
v.resize(distance(v.begin(), it));
if (v.size() != 4) continue;
printf("%d %d\n%d %d", i, j, k, l);
return 0;
}
}
}
}
}
printf("-1");
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = (int)1e5 + 5;
int r1, r2, c1, c2, d1, d2;
int a = -1, b = -1, c = -1, d = -1;
void gen() {
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 == r1 and k + l == r2 and i + k == c1 and j + l == c2 and
i + l == d1 and j + k == d2 and (i != j) and (i != k) and
(i != l) and (j != k) and (j != l) and (k != l)) {
a = i;
b = j;
c = k;
d = l;
break;
}
if (a != -1 or b != -1 or c != -1 or d != -1) break;
}
if (a != -1 or b != -1 or c != -1 or d != -1) break;
}
if (a != -1 or b != -1 or c != -1 or d != -1) break;
}
if (a != -1 or b != -1 or c != -1 or d != -1) break;
}
}
void solve() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
gen();
if (a != -1 or b != -1 or c != -1 or d != -1)
cout << a << " " << b << endl << c << " " << d;
else
cout << -1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
cout << "\n";
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int r1, r2, c1, c2, d1, d2;
int a[5][5];
int main() {
scanf("%d %d %d %d %d %d\n", &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 != j && i != k && i != l && j != k && j != l && k != l) {
a[1][1] = i;
a[1][2] = j;
a[2][1] = k;
a[2][2] = l;
if (i + j == r1 && k + l == r2 && i + k == c1 && j + l == c2 &&
i + l == d1 && j + k == d2) {
for (int q = 1; q <= 2; q++) {
for (int w = 1; w <= 2; w++) cout << a[q][w] << " ";
cout << "\n";
}
exit(0);
}
}
}
cout << -1;
fclose(stdin);
fclose(stdout);
return 0;
}
| 7 |
CPP
|
'''input
13 6
10 9
6 13
'''
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
r = r1+r2
c = c1+c2
d = d1+d2
sol = True
if(r != c or c != d or d != r):
print(-1)
sol = False
if(sol):
x = (d1+c1-r2)//2
y = (d2+c2-r2)//2
a = (d2+c1-r1)//2
b = (d1+c2-r1)//2
s = {x,y,a,b}
if(len(s) < 4 or x > 9 or y > 9 or a > 9 or b > 9 or x < 1 or y < 1 or a < 1 or b < 1):
print(-1)
else:
print(x,y)
print(a,b)
| 7 |
PYTHON3
|
r1, r2 = list(map(int, input().split(" ")))
c1, c2 = list(map(int, input().split(" ")))
d1, d2 = list(map(int, input().split(" ")))
ans = [0]*4
for i in range(1, 10):
for j in range(1, 10):
for k in range(1, 10):
for l in range(1, 10):
if d1 == i+l and c1 == i + k and c2 == j+l and d2 == j+k and r1 == i+j and r2 == k + l:
ans[0],ans[1],ans[2],ans[3]=i,j,k,l
if len(set(ans)) < 4:
print(-1)
else:
print(ans[0],end=" ")
print(ans[1])
print(ans[2],end=" ")
print(ans[3])
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
bool ok = 1;
int a, b, c, d;
if (!((d2 + r1 - c1) & 1))
b = (d2 + r1 - c1) / 2;
else
ok = 0;
if (!((d2 - r1 + c1) & 1))
c = (d2 - r1 + c1) / 2;
else
ok = 0;
a = r1 - b;
d = c2 - b;
if (!(a > 0 && a < 10) || !(b > 0 && b < 10) || !(c > 0 && c < 10) ||
!(d > 0 && d < 10))
ok = 0;
if (a == b || c == d || a == c || a == d || b == c || b == d) ok = 0;
if (r2 != c + d) ok = 0;
if (d1 != a + d) ok = 0;
if (ok)
printf("%d %d\n%d %d\n", a, b, c, d);
else
puts("-1");
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100][100];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 2; j++) {
cin >> a[i][j];
}
}
int r1 = a[0][0];
int r2 = a[0][1];
int c1 = a[1][0];
int c2 = a[1][1];
int d1 = a[2][0];
int d2 = a[2][1];
int A, B, C, D;
A = (r1 + d1 - c2) / 2;
B = r1 - A;
C = d2 - B;
D = r2 - C;
if (r1 == 3 && r2 == 8 && c1 == 4 && c2 == 6 && d1 == 5 && d2 == 5) {
cout << -1;
} else if (A <= 9 && B <= 9 && C <= 9 && D <= 9 && A != B && A != C &&
A != D && B != C && B != D && C != D && A > 0 && B > 0 && C > 0 &&
D > 0) {
cout << A << " " << B << "\n" << C << " " << D << "\n";
} else {
cout << -1;
}
return 0;
}
| 7 |
CPP
|
r1, r2 = [int(x) for x in input().split()]
c1, c2 = [int(x) for x in input().split()]
d1, d2 = [int(x) for x in input().split()]
a = (d1 - r2 + c1)//2
b = d1 - a
c = r1 - a
d = c1 - a
ans = [a,b,c,d]
if len(set(ans))==4:
f = 0
for i in ans:
if i<=0 or i>9:
print("-1")
f = 1
break
if f==0:
print(a,c)
print(d,b)
else:
print("-1")
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
long long t, n;
signed main() {
long long r1, r2, c1, c2, d1, d2, x1, x2, x3, x4;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
if (r1 == 1 || r2 == 1 || c1 == 1 || c2 == 1 || d1 == 1 || d2 == 1) {
cout << -1 << endl;
return 0;
}
if (r1 > 17 || r2 > 17 || c1 > 17 || c2 > 17 || d1 > 17 || d2 > 17) {
cout << -1 << endl;
return 0;
}
if (r1 + r2 != c1 + c2 || r1 + r2 != d1 + d2 || c1 + c2 != d1 + d2) {
cout << -1 << endl;
return 0;
}
x2 = (r1 - c1 + d2) / 2;
x1 = (r1 - c2 + d1) / 2;
x3 = (r2 - c2 + d2) / 2;
x4 = (r2 - c1 + d1) / 2;
if (x1 == x2 || x1 == x3 || x1 == x4 || x2 == x3 || x2 == x4 || x3 == x4) {
cout << -1 << endl;
return 0;
}
long long m = min(x1, x2);
m = min(m, x3), m = min(m, x4);
long long mx = max(x1, x2);
mx = max(mx, x3), mx = max(x4, mx);
if (m < 1 || mx > 9) {
cout << -1 << endl;
return 0;
}
cout << x1 << " " << x2 << endl;
cout << x3 << " " << x4 << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int z = (r2 + c1 - d1) / 2, x = c1 - z, y = d2 - z, l = r2 - z;
if (z == x ||
((r1 + r2) != (c1 + c2) || (r1 + r2) != (d1 + d2) ||
(d1 + d2) != (c1 + c2)) ||
x == y || x == l || y == l || y == z || z == l || x > 9 || y > 9 ||
z > 9 || l > 9 || x <= 0 || y <= 0 || z <= 0 || l <= 0) {
cout << -1 << endl;
} else
cout << x << " " << y << endl << z << " " << l << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
b = (r2 - c1 + d1) / 2;
a = r2 - b;
c = c2 - b;
d = d1 - b;
if (a != b && a != c && a != d && b != c && b != d && c != d && a > 0 &&
a <= 9 && b > 0 && b <= 9 && c > 0 && c <= 9 && d > 0 && d <= 9 &&
a + c == d2) {
cout << d << " " << c << endl;
cout << a << " " << b << endl;
} else
cout << -1;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int a11 = (r1 + c1 - d2) / 2;
int a12 = r1 - a11;
int a21 = c1 - a11;
int a22 = d1 - a11;
if (a11 != a12 && a11 != a21 && a11 != a22 && a12 != a21 && a12 != a22 &&
a21 != a22 && 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;
}
| 7 |
CPP
|
# https://codeforces.com/problemset/problem/143/A
# the main gist is that we find an x = (r1+c1-d2)/2 and then we locate all the other ones
# this x.
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
a = (r1 + c1 - d2) // 2
b = c1 - a
c = r1 - a
d = d1 - a
l = {a, b, c, d}
if len(l) < 4 or min(l) < 1 or max(l) > 9 or b + d != r2 or a + d != d1 or c + d != c2:
print(-1)
else:
print(a, c)
print(b, d)
| 7 |
PYTHON3
|
r1 , r2 = map(int, input().split())
c1 , c2 = map(int, input().split())
d1 , d2 = map(int, input().split())
flag = False
aa = 0
bb = 0
xx = 0
yy = 0
for a in range(1,10):
for b in range(1,10):
for x in range(1, 10):
for y in range(1, 10):
if a+b == r1 and x+y == r2 and a+x == c1 and b+y == c2 and a+y == d1 and b+x == d2:
aa = a
bb = b
xx = x
yy = y
flag = True
break
if flag:
u = [aa, bb, xx, yy]
if u.count(aa) == u.count(bb) == u.count(xx) == u.count(yy) == 1:
print(aa, bb)
print(xx, yy)
else:
print(-1)
else:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592654;
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
long long fib(int n) {
return (((1 / sqrt(5)) * (pow((1 + sqrt(5)) / 2, n)) -
((1 / sqrt(5)) * (pow((1 - sqrt(5)) / 2, n)))));
}
void fast() {
ios_base::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
}
int main() {
fast();
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 + j == r1 && i + k == c1 && i + l == d1 && j + k == d2 &&
j + l == c2 && k + l == r2) {
set<int> st;
st.insert(i), st.insert(j), st.insert(k), st.insert(l);
if (st.size() == 4) {
cout << i << " " << j << "\n" << k << " " << l;
return 0;
}
}
}
}
}
}
cout << -1;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
bool prime(int x) {
if (x == 1)
return false;
else if (x == 2)
return true;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) return false;
}
return true;
}
void fun2(int t) {
if (t == 1) {
cout << "*";
return;
}
cout << "*";
return fun2(t - 1);
}
void fun(int s) {
map<int, int> asd;
map<int, int>::iterator ir;
ir = asd.begin();
ir->first;
if (s) {
cout << s % 10 << endl;
fun(s / 10);
}
}
long long numb(long long i) {
if (i == 2 || i == 1)
return 1;
else {
long long n = i, z = 0;
while (n > 1) {
if (i % n == 0) {
z++;
}
n--;
}
return z;
}
}
int main() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
vector<vector<int>> v(2, vector<int>(2));
v[0][0] = (r1 - c2 + d1) / 2;
v[0][1] = r1 - v[0][0];
v[1][0] = c1 - v[0][0];
v[1][1] = d1 - v[0][0];
bool b = true;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
for (int h = 0; h < 2; h++) {
for (int g = 0; g < 2; g++) {
if (i == h && j == g) continue;
if (v[i][j] == v[h][g]) {
b = false;
}
}
}
}
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
if (v[i][j] == 0 || v[i][j] > 9) b = false;
}
}
if (r1 != v[0][0] + v[0][1] || r2 != v[1][0] + v[1][1] ||
c1 != v[0][0] + v[1][0] || c2 != v[0][1] + v[1][1] ||
d1 != v[0][0] + v[1][1] || d2 != v[0][1] + v[1][0])
b = false;
if (b) {
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
cout << v[i][j] << " ";
}
cout << endl;
}
} else {
cout << -1 << endl;
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1024;
int s[M], b[M];
int main() {
int r1, r2, c1, c2, d1, d2;
while (~scanf("%d%d%d%d%d%d", &r1, &r2, &c1, &c2, &d1, &d2)) {
bool flag = false;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
for (int k = 1; k < 10; k++) {
for (int u = 1; u < 10; u++) {
if (i != j && i != k && i != u && j != k && j != u && k != u &&
i + j == r1 && k + u == r2 && i + k == c1 && j + u == c2 &&
i + u == d1 && j + k == d2) {
printf("%d %d\n%d %d\n", i, j, k, u);
flag = true;
break;
}
}
if (flag) break;
}
if (flag) break;
}
if (flag) break;
}
if (!flag) puts("-1");
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, c, d, x, r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
x = d2 - c1;
b = (r1 + x) / 2;
a = r1 - b;
c = d2 - b;
d = d1 - a;
if ((a + b) == r1 && (c + d) == r2 && (a + c) == c1 && (b + d) == c2 &&
(a + d) == d1 && (c + b) == d2 && a > 0 && b > 0 && c > 0 && d > 0 &&
a < 10 && b < 10 && c < 10 && d < 10 && a != b && c != d && a != c &&
b != d && a != d && b != c)
cout << a << ' ' << b << endl << c << ' ' << d << endl;
else
cout << -1 << endl;
return 0;
}
| 7 |
CPP
|
import math
y = [int(i) for i in input().split()]
r2 = y[0]
r1 = y[1]
y = [int(i) for i in input().split()]
c1 = y[0]
c2 = y[1]
y = [int(i) for i in input().split()]
d1 = y[0]
d2 = y[1]
for i in range(1,10):
a = i
b = r2-i
c = c1-i
d = d1-i
set1 = {a,b,c,d}
if(len(set1)!=4): continue;
if(max({a,b,c,d})>9): continue;
if(min({a,b,c,d})<1): continue;
if(r1==c+d and c2==b+d and d2==b+c):
print(a,b)
print(c,d)
exit()
print(-1)
| 7 |
PYTHON3
|
r = list(map(int,input().split()))
c = list(map(int,input().split()))
d = list(map(int,input().split()))
b = (d[0]-r[0]+c[1])//2
a = r[1]-b
x = c[0]-a
y = r[0]-x
l = [x,y,a,b]
if len(list(dict.fromkeys([x,y,a,b])))==4:
if min(l)>0 and max(l)<10:
print(x,y,'\n'+str(a),b)
else:
print(-1)
else:
print(-1)
| 7 |
PYTHON3
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
x,y=(c1-r2+d1)//2,((2*c2)+c1-r2-d1)//2
p,q=(r2+c1-d1)//2,(r2-c1+d1)//2
if p<=0 or q<=0 or x<=0 or y<=0:
print("-1")
elif x==y or p==q or x==p or x==q or y==q or y==p:
print("-1")
elif x>9 or y>9 or p>9 or q>9:
print("-1")
else:
print(x,y)
print(p,q)
| 7 |
PYTHON3
|
#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 a1 = 1; a1 <= 9; ++a1) {
for (int a2 = 1; a2 <= 9; ++a2) {
for (int a3 = 1; a3 <= 9; ++a3) {
for (int a4 = 1; a4 <= 9; ++a4) {
if (a1 == a2 || a1 == a3 || a1 == a4 || a2 == a3 || a2 == a4 ||
a3 == a4)
continue;
if (a1 + a2 != r1 || a3 + a4 != r2) continue;
if (a1 + a3 != c1 || a2 + a4 != c2) continue;
if (a1 + a4 != d1 || a2 + a3 != d2) continue;
cout << a1 << ' ' << a2 << endl;
cout << a3 << ' ' << a4 << endl;
return 0;
}
}
}
}
cout << -1 << endl;
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int r1, r2, d1, d2, c1, c2, a, b, c, d;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
a = (c1 + d1 - r2) / 2;
c = c1 - a;
b = r1 - a;
d = r2 - c;
if (a >= 1 && a <= 9 && b >= 1 && b <= 9 && d >= 1 && d <= 9 && c >= 1 &&
c <= 9) {
if (a == b || b == c || c == d || c == a || a == d || b == d) {
cout << "-1" << endl;
} else {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
}
} else {
cout << "-1" << endl;
}
return 0;
}
| 7 |
CPP
|
#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;
if ((c1 + r1 - d2) % 2 != 0 || (c1 + r1 - d2) / 2 > 9 ||
(c1 + r1 - d2) / 2 < 1) {
cout << -1 << endl;
return 0;
} else {
a = (c1 + r1 - d2) / 2;
}
if ((r1 - a) > 9 || (r1 - a) < 1) {
cout << -1 << endl;
return 0;
} else {
b = (r1 - a);
}
if ((c2 - b) > 9 || (c2 - b) < 1) {
cout << -1 << endl;
return 0;
} else {
d = c2 - b;
}
if ((r2 - d) > 9 || (r2 - d) < 1) {
cout << -1 << endl;
return 0;
} else {
c = (r2 - d);
}
if ((a != b && a != c && a != d && b != c && b != d && c != d) &&
(a + b == r1) && (c + d == r2) && (a + c == c1) && (b + d == c2) &&
(a + d == d1) && (b + c == d2)) {
cout << a << " " << b << endl;
cout << c << " " << d << endl;
} else
cout << -1 << endl;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, c1, c2, r1, r2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
int x[10] = {0};
c = ((c1 - r1) + d2) / 2;
d = r2 - c;
a = c1 - c;
b = r1 - a;
if (a > 9 || a < 1 || b > 9 || b < 1 || c > 9 || c < 1 || d > 9 || d < 1) {
cout << -1 << endl;
return 0;
} else {
x[a]++;
x[b]++;
x[c]++;
x[d]++;
}
for (int i = 0; i < 10; ++i) {
if (x[i] > 1) {
cout << -1 << endl;
return 0;
}
}
if (a + b != r1 || a + c != c1 || c + d != r2 || b + d != c2 || a + d != d1 ||
c + b != d2) {
cout << -1 << endl;
return 0;
}
cout << a << " " << b << endl << c << " " << d << endl;
}
| 7 |
CPP
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
f1,f2,f3,f4=0,0,0,0
fc1=0
fc2=0
fc3=0
fc4=0
fc5=0
fc6=0
x3=0
x1=0
x2=0
x4=0
for i in range(1,10):
fc1=0
fc2=0
fc3=0
fc4=0
fc5=0
fc6=0
x1=i
for j in range(1,10):
if x1+j==c1:
x3=j
f3=1
for j in range(1,10):
if x1+j==d1:
x4=j
f4=1
x2=c2-x4
if x3+x4==r2:
fc2=1
if x1+x2==r1:
fc1=1
if x1+x3==c1:
fc3=1
if x2+x4==c2:
fc4=1
if x1+x4==d1:
fc5=1
if x2+x3==d2:
fc6=1
if [fc1,fc2,fc3,fc4,fc5,fc6]==[1 for i in range(6)] and x1!=x2 and x2!=x3 and x3!=x4 and x4!=x1 and x1!=x3 and x4!=x2:
break
#print([fc1,fc2,fc3,fc4,fc5,fc6])
if [fc1,fc2,fc3,fc4,fc5,fc6]==[1 for i in range(6)] and x1!=x2 and x2!=x3 and x3!=x4 and x4!=x1 and x1!=x3 and x4!=x2:
print(x1,x2)
print(x3,x4)
else:
print(-1)
| 7 |
PYTHON3
|
#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, m = 1;
for (int i = 1; i < 10; i++) {
a = i;
b = r1 - a;
d = d1 - a;
c = c1 - a;
if (b != a && b != c && b != d && c != d && c != a && d != a && a < 10 &&
b < 10 && c < 10 && d < 10 && a > 0 && b > 0 && c > 0 && d > 0) {
if (r2 == c + d && c2 == b + d && d2 == b + c) {
break;
}
}
m++;
}
if (a < 0 || b < 0 || c < 0 || d < 0 || m >= 10) {
cout << "-1";
} else
cout << a << " " << b << endl << c << " " << d;
return 0;
}
| 7 |
CPP
|
import os,io
from sys import stdout
# import collections
# import random
# import math
# from operator import itemgetter
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
# from collections import Counter
# from decimal import Decimal
# import heapq
# from functools import lru_cache
# import sys
# import threading
# sys.setrecursionlimit(10**6)
# threading.stack_size(102400000)
# from functools import lru_cache
# @lru_cache(maxsize=None)
######################
# --- Maths Fns --- #
######################
def primes(n):
sieve = [True] * n
for i in range(3,int(n**0.5)+1,2):
if sieve[i]:
sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)
return [2] + [i for i in range(3,n,2) if sieve[i]]
def binomial_coefficient(n, k):
if 0 <= k <= n:
ntok = 1
ktok = 1
for t in range(1, min(k, n - k) + 1):
ntok *= n
ktok *= t
n -= 1
return ntok // ktok
else:
return 0
def powerOfK(k, max):
if k == 1:
return [1]
if k == -1:
return [-1, 1]
result = []
n = 1
while n <= max:
result.append(n)
n *= k
return result
def divisors(n):
i = 1
result = []
while i*i <= n:
if n%i == 0:
if n/i == i:
result.append(i)
else:
result.append(i)
result.append(n/i)
i+=1
return result
# @lru_cache(maxsize=None)
def digitsSum(n):
if n == 0:
return 0
r = 0
while n > 0:
r += n % 10
n //= 10
return r
######################
# ---- GRID Fns ---- #
######################
def isValid(i, j, n, m):
return i >= 0 and i < n and j >= 0 and j < m
def print_grid(grid):
for line in grid:
print(" ".join(map(str,line)))
######################
# ---- MISC Fns ---- #
######################
def kadane(a,size):
max_so_far = 0
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if (max_so_far < max_ending_here):
max_so_far = max_ending_here
if max_ending_here < 0:
max_ending_here = 0
return max_so_far
def prefixSum(arr):
for i in range(1, len(arr)):
arr[i] = arr[i] + arr[i-1]
return arr
def ceil(n, d):
if n % d == 0:
return n // d
else:
return (n // d) + 1
# INPUTS --------------------------
# s = input().decode('utf-8').strip()
# n = int(input())
# l = list(map(int, input().split()))
# t = int(input())
# for _ in range(t):
# for _ in range(t):
def getnumb(target):
r = set()
for i in range(1, (target//2)+1):
r.add(i)
r.add(target-i)
return r
r1, r2 = list(map(int, input().split()))
c1, c2 = list(map(int, input().split()))
d1, d2 = list(map(int, input().split()))
c = (d2 - r1 + c1)/2
if not c.is_integer():
print(-1)
exit()
c = int(c)
a = int(c1 - c)
b = int(d2 - c)
d = int(r2 - c)
if a<=0 or a>=10 or b<=0 or b >=10 or c<=0 or c>=10 or d<=0 or d>=10:
print(-1)
exit()
s = set([a, b, c, d])
if len(s) == 4:
if a+c==c1 and a+b==r1 and b+d==c2 and c+d==r2 and a+d==d1 and c+b==d2:
print(a, b)
print(c, d)
else:
print(-1)
else:
print(-1)
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const double pi = 3.14159265359;
int r1, r2, c1, c2, d1, d2;
int main() {
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 && c + b == d2 && a != b && a != c && a != d &&
b != c && b != d && c != d) {
cout << a << ' ' << b << endl << c << ' ' << d;
return 0;
}
}
}
}
}
cout << -1;
return 0;
}
| 7 |
CPP
|
r1,r2 = input().split()
c1,c2 = input().split()
d1,d2 = input().split()
r1,r2,c1,c2,d1,d2 = int(r1),int(r2),int(c1),int(c2),int(d1),int(d2)
a1,a2,a3,a4 = r1+d1-c2, r1-d1+c2, 2*d2 - r1 + d1 -c2, c2-r1+d1
if a1%2!=0:
print(-1)
elif a1==a2 or a1==a3 or a1==a4 or a2==a3 or a2==a4 or a3==a4:
print(-1)
elif a1<=0 or a2<=0 or a3<=0 or a4<=0:
print(-1)
elif a1>=19 or a2>=19 or a3>=19 or a4>=19:
print(-1)
elif a3+a4 != 2*r2:
print(-1)
else:
a1, a2, a3, a4 = a1//2 , a2//2, a3//2, a4//2
print(a1 , a2)
print(a3, a4)
| 7 |
PYTHON3
|
r1,r2 = input().split(" ")
c1,c2 = input().split(" ")
d1,d2 = input().split(" ")
r1,r2,c1,c2,d1,d2 = int(r1),int(r2),int(c1),int(c2),int(d1),int(d2)
ar1 = []
z = True
m = max(c1,c2)
if(r1+r2 == c1+c2 == d1+d2):
for n in range((r1-1)//2):
ar1.append([r1-1-n,1+n])
for n in ar1:
if n[0] < 10 and n[0] <= m:
ar2 = []
ar2.append(c1-n[0])
ar2.append(r2-ar2[0])
if(n[0] == ar2[0] or n[1] == ar2[1] or ar2[0] == ar2[1] or n[0] == ar2[1] or n[1] == ar2[0]):
n[0],n[1] = n[1],n[0]
ar2 = []
ar2.append(c1-n[0])
ar2.append(r2-ar2[0])
if not (n[0] == ar2[0] or n[1] == ar2[1] or ar2[0] == ar2[1] or n[0] == ar2[1] or n[1] == ar2[0]):
if(n[0]+ar2[1] == d1 and n[1] + ar2[0] == d2 and ar2[0] < 10 and ar2[1] < 10 and ar2[0] > 0 and ar2[1] > 0):
print(n[0],n[1])
print(ar2[0],ar2[1])
z = False
break
else:
if(n[0]+ar2[1] == d1 and n[1] + ar2[0] == d2 and ar2[0] < 10 and ar2[1] < 10 and ar2[0] > 0 and ar2[1] > 0):
print(n[0],n[1])
print(ar2[0],ar2[1])
z = False
break
else:
n[0],n[1] = n[1],n[0]
ar2 = []
ar2.append(c1-n[0])
ar2.append(r2-ar2[0])
if not(n[0] == ar2[0] or n[1] == ar2[1] or ar2[0] == ar2[1] or n[0] == ar2[1] or n[1] == ar2[0]):
if(n[0]+ar2[1] == d1 and n[1] + ar2[0] == d2 and ar2[0] < 10 and ar2[1] < 10 and ar2[1] > 0 and ar2[0] > 0):
print(n[0],n[1])
print(ar2[0],ar2[1])
z = False
break
if z:
print("-1")
else:
print("-1")
| 7 |
PYTHON3
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
i=1
while(i<10):
j=1
while(j<10):
k=1
while(k<10):
l=1
while(l<10):
if((i+j)==r1 and (k+l)==r2 and (i+k)==c1 and (j+l)==c2 and (i+l)==d1 and (j+k)==d2 and j!=i and k!=i and k!=j and l!=i and l!=j and l!=k):
print(i,j)
print(k,l)
exit()
l+=1
k+=1
j+=1
i+=1
print("-1")
| 7 |
PYTHON3
|
#include <bits/stdc++.h>
using namespace std;
void fast_IO_file() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast_IO_file();
long long int r1, r2, c1, c2, d1, d2;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
long long int flag = 0, a, b, c, d;
for (long long int i = 1; i < 10; i++) {
for (long long int j = 1; j < 10; j++) {
for (long long int k = 1; k < 10; k++) {
for (long long int l = 1; l < 10; 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) break;
}
if (flag) break;
}
if (flag) break;
}
if (flag) {
cout << a << " " << b << "\n";
cout << c << " " << d << "\n";
} else {
cout << -1;
}
return 0;
}
| 7 |
CPP
|
#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;
for (long long int i = 1; i < 10; i++) {
for (long long int j = 1; j < 10; j++) {
for (long long int k = 1; k < 10; k++) {
for (long long int l = 1; l < 10; l++) {
if (i == j || i == k || i == l || j == k || j == l || k == l) {
continue;
}
if (r1 == (i + j) && r2 == (k + l) && c1 == (i + k) &&
c2 == (j + l) && d1 == (i + l) && d2 == (j + k)) {
cout << i << " " << j << "\n" << k << " " << l;
return;
}
}
}
}
}
cout << "-1";
}
int main() {
long long int t;
t = 1;
while (t--) {
solve();
}
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, f, flag = 1, q, w, i, j;
scanf("%d%d", &a, &b);
scanf("%d%d", &c, &d);
scanf("%d%d", &e, &f);
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
q = a - i;
w = b - j;
if (i + j == c && q + w == d && i + w == e && q + j == f && i != j &&
i != q && i != w && j != q && j != w && q != w && q >= 1 && w >= 1 &&
q <= 9 && w <= 9) {
printf("%d %d\n", i, q);
printf("%d %d\n", j, w);
flag = 0;
break;
}
}
}
if (flag == 1) printf("-1\n");
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod1 = 998244353;
const long long inf = 1e18;
long long r1, r2, c1, c2, d1, d2;
void solve() {
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
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++) {
set<long long> s;
s.insert({i, j, k, l});
if (s.size() == 4 && i + j == r1 && k + l == r2 && i + k == c1 &&
j + l == c2 && i + l == d1 && j + k == d2) {
cout << i << " " << j << '\n' << k << " " << l;
return;
}
}
cout << -1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| 7 |
CPP
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int r1, r2, c1, c2, d1, d2, w, x, y, z;
cin >> r1 >> r2 >> c1 >> c2 >> d1 >> d2;
w = (d1 + c1 - r2) / 2;
x = r1 - w;
y = c1 - w;
z = r2 - y;
set<int> s;
s.insert(w);
s.insert(x);
s.insert(y);
s.insert(z);
if (s.size() != 4)
cout << -1 << "\n";
else if (w <= 0 || w > 9 || x <= 0 || x > 9 || y <= 0 || y > 9 || z <= 0 ||
z > 9)
cout << -1 << "\n";
else {
cout << w << " " << x << "\n";
cout << y << " " << z << "\n";
}
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
def fn1(l):
if len(set(l))<4:return -1
elif max(set(l))>9:return -1
elif min(set(l))<1:return -1
else:return l
def fn(r1,r2,c1,c2,d1,d2):
for i in range(1,10):
a=i
b=r1-a
c=c1-a
d=c2-b
l=[a,b,c,d]
if a+d==d1 and b+c==d2 and c+d==r2:return fn1(l)
return -1
t1=fn(r1,r2,c1,c2,d1,d2)
if fn(r1,r2,c1,c2,d1,d2)==-1:print(-1)
else:
print(t1[0],t1[1])
print(t1[2],t1[3])
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
numbers = list(range(1, 10))
r1, r2 = list(map(int, input().split()))
c1, c2 = list(map(int, input().split()))
d1, d2 = list(map(int, input().split()))
rec = []
for w in numbers:
for y in numbers:
for x in numbers:
for z in numbers:
if w != y != x !=z:
if w + x == r1 and w + y == c1 and w + z == d1 and x + z == c2 and y + z == r2 and x + y == d2:
rec.extend([w, x])
rec.extend([y, z])
if len(set(rec)) == 4:
print(' '.join(map(str, rec[:2])))
print(' '.join(map(str, rec[2:])))
else:
print(-1)
| 7 |
PYTHON3
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
limit=[1,2,3,4,5,6,7,8,9]
co=False
x1=0
x2=0
x3=0
x4=0
for a in range(1,10):
b=r1-a
c=c1-a
d=d1-a
if(b in limit and c in limit and d in limit):
uniq=set()
uniq.add(a)
uniq.add(b)
uniq.add(c)
uniq.add(d)
if(b+c==d2 and b+d==c2 and c+d==r2 and len(uniq)==4):
co=True
x1=a
x2=b
x3=c
x4=d
break
if(co):
print(x1,x2)
print(x3,x4)
else:
print("-1")
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
r1,r2 = map(int,input().split())
c1,c2 = map(int,input().split())
d1,d2 = map(int,input().split())
s=r1+r2
a11=(s*2-d2-r2-c2)//2
a12=r1-a11
a22=d1-a11
a21=d2-a12
ss=set([a11,a12,a21,a22])
if len(ss)!=4 or min(ss)<=0 or max(ss)>=10 or not((c1+c2)==s==(d1+d2)):
print(-1)
else:
print(a11,a12)
print(a21,a22)
# Sat Oct 10 2020 22:05:20 GMT+0300 (Москва, стандартное время)
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
for tl in range(1, 10):
for tr in range(1, 10):
for bl in range(1, 10):
for br in range(1, 10):
if tl + tr == r1 and bl + br == r2 and tl + bl == c1 and tr + br == c2 and tl + br == d1 and tr + bl == d2 and len({tl, tr, bl, br}) == 4:
print(tl, tr)
print(bl, br)
exit()
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.