solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
z=0
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
for x in range(1,10):
x2=r1-x
x3=c1-x
if x3<r2:
x4=r2-x3
if x3+x2==d2 and x+x4==d1 and 0<x<10 and 0<x2<10 and 0<x3<10 and 0<x4<10:
if x!=x2 and x3!=x4 and x!=x4 and x3!=x2 and x!=x3 and x2!=x4:
print('%d %d'%(x,x2))
print('%d %d'%(x3,x4))
z+=1
if z==0:
print(-1)
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
m = min(r1, r2, c1, c2, d1, d2)
i = 1
while 1:
x1 = i
x2 = c1 - x1
y1 = r1 - x1
y2 = r2 - x2
i += 1
if (x1<=0) | (x2<=0) | (y1<=0) | (y2<=0) | (x1>9) | (x2>9) | (y1>9) | (y2>9) | (x1 + y2 != d1) | (x2 + y1 != d2) | (x1 + x2 != c1) | (y2 + y1 != c2) | (x1 + y1 != r1) | (x2 + y2 != r2):
if i > 9:
print('-1')
break
continue
else:
if (x1==x2) | (x1==y1) | (y1==y2) | (x1==y2) | (x2==y1) | (x2==y2):
print('-1')
else:
print(x1, y1)
print(x2, y2)
break
# if m == c1:
# x1 = m - i
# x2 = c1 - x1
# y1 = r1 - x1
# y2 = c2 - y1
# elif m == c2:
# y1 = m - i
# y2 = c2 - y1
# x1 = r1 - y1
# x2 = c1 - x1
# elif m == r1:
# x1 = m - i
# x2 = c1 - x1
# y1 = r1 - x1
# y2 = c2 - y1
# elif m == r2:
# x2 = m - i
# x1 = c1 - x2
# y1 = r1 - x1
# y2 = c2 - y1
# elif m == d1:
# x1 = m - i
# x2 = c1 - x1
# y1 = r1 - x1
# y2 = c2 - y1
# elif m == d2:
# y1 = m - i
# y2 = c2 - y1
# x1 = r1 - y1
# x2 = c1 - x1
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
a = r1 + d1 - c2
if a % 2: print(-1)
else:
a = a // 2
b = r1 - a
d = d1 - a
c = r2 - d
if c1 != a + c or c2 != b + d or d2 != b + c: print(-1)
elif len(set([a, b, c, d])) < 4 or min(a, b, c, d) < 1 or max(a, b, c, d) > 9: print(-1)
else:
print(a, b)
print(c, d)
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
x = (d1 + c1 - r2) // 2
y = r1 - x
z = c1 - x
w = d1 - x
if 1 <= x <= 9 and 1 <= y <= 9 and 1 <= z <= 9 and 1 <= w <= 9 and len(set([x, y, z, w])) == 4:
print(x, y)
print(z, w)
else:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
m = min(r1, r2, c1, c2, d1, d2)
i = 1
while 1:
if m == c1:
x1 = m - i
x2 = c1 - x1
y1 = r1 - x1
y2 = c2 - y1
elif m == c2:
y1 = m - i
y2 = c2 - y1
x1 = r1 - y1
x2 = c1 - x1
elif m == r1:
x1 = m - i
x2 = c1 - x1
y1 = r1 - x1
y2 = c2 - y1
elif m == r2:
x2 = m - i
x1 = c1 - x2
y1 = r1 - x1
y2 = c2 - y1
elif m == d1:
x1 = m - i
x2 = c1 - x1
y1 = r1 - x1
y2 = c2 - y1
elif m == d2:
y1 = m - i
y2 = c2 - y1
x1 = r1 - y1
x2 = c1 - x1
i += 1
if (x1<=0) | (x2<=0) | (y1<=0) | (y2<=0) | (x1>9) | (x2>9) | (y1>9) | (y2>9) | (x1 + y2 != d1) | (x2 + y1 != d2) | (x1 + x2 != c1) | (y2 + y1 != c2) | (x1 + y1 != r1) | (x2 + y2 != r2):
if i >= 9:
print('-1')
break
continue
else:
if (x1==x2) | (x1==y1) | (y1==y2) | (x1==y2) | (x2==y1) | (x2==y2):
print('-1')
else:
print(x1, y1)
print(x2, y2)
break
| 7 |
PYTHON3
|
from sys import stdin, stdout
INF=1e11
# import math
def get_int(): return int(stdin.readline().strip())
def get_ints(): return map(int,stdin.readline().strip().split())
def get_array(): return list(map(int,stdin.readline().strip().split()))
def get_string(): return stdin.readline().strip()
def op(c): return stdout.write(c)
# from collections import defaultdict
# for _ in range(int(stdin.readline())):
r1,r2=get_ints()
c1,c2=get_ints()
d1,d2=get_ints()
arr=[[0,0],[0,0]]
f=0
for i in range(1,10):
arr[0][0]=i
for j in range(1,10):
arr[0][1]=j
for k in range(1,10):
arr[1][0]=k
for l in range(1,10):
arr[1][1]=l
if arr[0][0]+arr[0][1]==r1 and arr[1][0]+arr[1][1]==r2 and arr[0][0]+arr[1][0]==c1 and arr[0][1]+arr[1][1]==c2 and arr[0][0]+arr[1][1]==d1 and arr[1][0]+ arr[0][1]==d2:
s=set()
for x in range(2):
for y in range(2):
s.add(arr[x][y])
if len(s)<4:
continue
f=1
for x in range(2):
for y in range(2):
print(arr[x][y],end=" ")
print()
if f==0:
print(-1)
| 7 |
PYTHON3
|
#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);
}
}
| 7 |
CPP
|
def solve():
def readinput():
return map(int, input().strip().split())
r1, r2 = readinput()
c1, c2 = readinput()
d1, d2 = readinput()
for g1 in range(1, 10):
for g2 in range(1, 10):
for g3 in range(1, 10):
for g4 in range(1, 10):
s = set([g1, g2, g3, g4])
if len(s) == 4:
if r1 == g1 + g2 and r2 == g3 + g4 and c1 == g1 + g3 and c2 == g2 + g4 and d1 == g1 + g4 and d2 == g2 + g3:
return f"{g1} {g2}\n{g3} {g4}"
return -1
print(solve())
| 7 |
PYTHON3
|
r1, r2 = list(map(int, input().split()))
c1, c2 = list(map(int, input().split()))
d1, d2 = list(map(int, input().split()))
for i in range(1, 10):
for j in range(1, 10):
if i == j:
continue
for k in range(1, 10):
if i == k or j == k:
continue
for l in range(1, 10):
if i == l or j == l or k == l:
continue
if i + j == r1 and k + l == r2 and i + k == c1 and j + l == c2 and i + l == d1 and j + k == d2:
print(i, j)
print(k, l)
exit()
print(-1)
| 7 |
PYTHON3
|
from itertools import permutations
perm = permutations([1, 2, 3,4,5,6,7,8,9], 4)
x=0
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
check=True
for i in list(perm):
ans=permutations(list(i),4)
for j in list(ans):
k=list(j)
a=k[0]
b=k[1]
c=k[2]
d=k[3]
#a b
#c d
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)
check=False
if(not check):
break
if(not check):
break
if(check):
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
s=input('')
s1=input('')
s2=input('')
r1,r2=s.split(' ')
r1=int(r1)
r2=int(r2)
c1,c2=s1.split(' ')
c1=int(c1)
c2=int(c2)
d1,d2=s2.split(' ')
d1=int(d1)
d2=int(d2)
a=(2*r1-r2+2*c1-c2+2*d1-d2)/6
b=(2*r1-r2+2*c1+5*c2-4*d1-d2)/6
c=(-4*r1-r2+2*c1-c2+2*d1+5*d2)/6
d=(2*r1+5*r2-4*c1-c2+2*d1-d2)/6
# print(a,b,c,d)
l=[1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0]
l1=[]
if(a not in l1):
l1.append(a)
if(b not in l1):
l1.append(b)
if(c not in l1):
l1.append(c)
if(d not in l1):
l1.append(d)
if(a in l and b in l and c in l and d in l):
if(len(l1)==4):
print(int(a),int(b),end='\n')
print(int(c),int(d))
else:
print('-1')
else:
print('-1')
| 7 |
PYTHON3
|
import sys
def main():
(r1, r2) = map(int, sys.stdin.readline().split(' '))
(c1, c2) = map(int, sys.stdin.readline().split(' '))
(d1, d2) = map(int, sys.stdin.readline().split(' '))
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 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 j != k and i != k and k != l and l != j and i != l:
return [[i, j], [k, l]]
return [[-1, -1], [-1, -1]]
l = main()
if l[0][0] == -1:
sys.stdout.write("-1\n")
else:
for i in range(len(l)):
sys.stdout.write("{}\n".format((' '.join(list(map(str, l[i]))))))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
import collections
import sys
def read_a_integer():
return int(sys.stdin.readline())
def read_a_list(dtype):
return list(map(dtype, sys.stdin.readline().split()))
def main():
r1, r2 = read_a_list(int)
c1, c2 = read_a_list(int)
d1, d2 = read_a_list(int)
if (r1 - c1 + d2) % 2:
print("-1")
return
b = (r1 - c1 + d2) // 2
if (d2 - r1 + c1) % 2:
print("-1")
return
c = (d2 - r1 + c1) // 2
d = r2 - c
a = r1 - b
if all(1 <= x <= 9 for x in [a, b, c, d]) \
and len(set([a, b, c, d])) == 4 \
and b + d == c2 and a + d == d1:
print("{} {}\n{} {}".format(a, b, c, d))
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())
g1, g2, g3, g4 = -1, -1, -1, -1
result = False
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 i != j and i != k and i != l and j != k and j != l and k != 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:
g1, g2, g3, g4 = i, j, k, l
result = True
break
if result:
break
if result:
break
if result:
break
if result:
print(g1, g2)
print(g3, g4)
else:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
r1,r2 =map(int, input().split())
c1,c2 =map(int, input().split())
d1,d2 =map(int, input().split())
y=0
for i in range(1,d1):
if i>9:
break
b=i
x=d1-b
if x>=1 and x<=9:
a=c1-x
if a+b==r2:
y=r1-x
z=[x,y,a,b]
if y>=1 and y<=9 and a>=1 and a<=9 and len(set(z))==4:
break
else:
y=0
if y==0:
print(-1)
else:
print(str((x)) + ' ' +str((y)))
print(str((a))+ ' ' +str((b)))
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
d = int(((c2 + d1)-r1) / 2)
c = int(r2 - d)
a = int(d1 - d)
b = int(c2 - d)
# print(a, b, c, d)
if a == b or 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 or\
a + c != c1 or b + d != c2 or a + b != r1 or c + d != r2:
print('-1')
else:
print(a, b)
print(c, d)
| 7 |
PYTHON3
|
r=list(map(int,input().split()));c=list(map(int,input().split()));d=list(map(int,input().split()));ok=0
for i in range(1,10):
for j in range(1,10):
for k in range(1,10):
for e in range(1,10):
if(i!=j and i!=k and i!=e and j!=k and j!=e and k!=e and ok==0 and i+j==r[0] and k+e==r[1] and i+k==c[0] and j+e==c[1] and i+e==d[0] and j+k==d[1]):
print(i,j);print(k,e);ok=1
if(ok==0):print(-1)
| 7 |
PYTHON3
|
r1,r2 = map(int,input().split())
c1,c2 = map(int,input().split())
d1,d2 = map(int,input().split())
res = [[-1]]
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 i + j == r1 and i + k == c1 and i +l == d1 and j +l == c2 and k +l == r2 and j+k == d2 :
if len(set([i,j,k,l])) == 4:
res = [[i,j],[k,l]]
[print(*i) for i in res]
| 7 |
PYTHON3
|
def checking(r1, r2, c1, c2, d1, d2):
lis = [1, 2, 3, 4, 5, 6, 7, 8, 9]
ans = 0
for i in range(1, 10):
x = i
a = r1 - x
b = c1 - x
c = r2 - b
if (x != a and x != b and x != c and a != b and a != c and b != c) and (
a in lis and b in lis and c in lis and x in lis) and (
d1 == x + c and d2 == a + b and r1 == x + a and r2 == b + c and c1 == x + b and c2 == a + c):
print(x, a)
print(b, c)
break
ans += 1
if ans == 9:
print(-1)
r1, r2 = map(int,input().split())
c1, c2 = map(int,input().split())
d1, d2 = map(int,input().split())
checking(r1, r2, c1, c2, d1, d2)
# Wed Oct 14 2020 14:12:24 GMT+0300 (ΠΠΎΡΠΊΠ²Π°, ΡΡΠ°Π½Π΄Π°ΡΡΠ½ΠΎΠ΅ Π²ΡΠ΅ΠΌΡ)
| 7 |
PYTHON3
|
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())
eq1 = r1 + c1 + d1 # 3a
eq2 = r1 + c2+ d2 # 3b
eq3 = r2 + c1 + d2 # 3c
eq4 = r2 + c2 + d1 # 3d
s = eq1 + eq2 + eq3 + eq4
s /= 6
a = (eq1-s)/2
b = (eq2-s)/2
c = (eq3-s)/2
d = (eq4-s)/2
if a==b or a==c or a==d or c==b or d==b or c==d or a>9 or b>9 or c>9 or d>9 or a<1 or b<1 or c<1 or d<1: #a != int(a) or b != int(b) or c != int(c) or d != int(c):
print(-1)
else:
print(int(a), int(b))
print(int(c), int(d))
| 7 |
PYTHON3
|
from itertools import permutations
r1, r2 = list(map(int, input().split()))
c1, c2 = list(map(int, input().split()))
d1, d2 = list(map(int, input().split()))
for i, j, k, l in permutations(range(1, 10), 4):
if i + j == r1 and k + l == r2 and i+l == c1 and j+k == c2 and i+k == d1 and j + l == d2:
print(i, j)
print(l, k)
exit()
print(-1)
| 7 |
PYTHON3
|
import itertools
I=lambda:map(int,input().split())
a,b=I()
c,d=I()
e,f=I()
for m in itertools.combinations(range(1,10),4):
for w,x,y,z in itertools.permutations(m):
if [w+x,y+z,w+y,x+z,w+z,x+y]==[a,b,c,d,e,f]:
print(f'{w} {x}\n{y} {z}')
exit(0)
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 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;
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;
}
| 7 |
CPP
|
#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); }
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
i = (d1 - c2 + r1) / 2
j = r1 - i
k = c1 - i
w = d1 - i
if len(set([i,j,k,w])) + sum([1<=i<=9,1<=j<=9,1<=k<=9,1<=w<=9]) == 8 and k + w == r2 and j + k == d2:
print(int(i),int(j))
print(int(k),int(w))
exit()
print("-1")
| 7 |
PYTHON3
|
######################################################################
# Write your code here
import sys
from math import *
input = sys.stdin.readline
#import resource
#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])
#sys.setrecursionlimit(0x100000)
# Write your code here
RI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]
rw = lambda : input().strip().split()
ls = lambda : list(input().strip()) # for strings to list of char
from collections import defaultdict as df
import heapq
#heapq.heapify(li) heappush(li,4) heappop(li)
#import random
#random.shuffle(list)
infinite = float('inf')
#######################################################################
r1,r2=RI()
c1,c2=RI()
d1,d2=RI()
x1=(r1+c1-d2)//2
x2=(r1+c2-d1)//2
x3=(r2+c2-d2)//2
x4=(r2+c1-d1)//2
f=0
if((x1+x2)!=r1 or (x2+x3)!=c2 or (x3+x4)!=r2 or (x4+x1)!=c1 or (x1+x3)!=d1 or (x2+x4)!=d2):
print(-1)
elif(len(set([x1,x2,x3,x4]))<4 or max([x1,x2,x3,x4])>9 or min([x1,x2,x3,x4])<1):
print(-1)
else:
print(x1,end=" ")
print(x2)
print(x4,end=" ")
print(x3)
| 7 |
PYTHON3
|
r1 , r2 = map(int,input().split())
c1 , c2 = map(int,input().split())
d1 , d2 = map(int,input().split())
ans = [[0,0],[0,0]]
cnt = 1
while (cnt<10):
ans[0][0] = cnt
ans[0][1] = r1 - cnt
ans[1][0] = c1 - cnt
ans[1][1] = d1 - cnt
if (ans[1][0]+ans[1][1]!=r2) or (ans[0][1]+ans[1][1]!=c2) or (ans[1][0]+ans[0][1]!=d2):
ans = [[0,0],[0,0]]
cnt+=1
else:
break
if len(list(set([ans[0][0],ans[0][1],ans[1][0],ans[1][1]])))!=4 or (max(ans[0])>9 or max(ans[1])>9) or (min(ans[0])<1 or min(ans[1])<1):
print(-1)
else:
print(ans[0][0],ans[0][1])
print(ans[1][0],ans[1][1])
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
hallado = True
for x3 in range(1,10):
for x4 in range(1,10):
if (r1 == d1 - x4 + d2 -x3) and (r2 == x3 + x4)and (c1== d1 - x4 + x3) and (c2 == d2 - x3 + x4) and (x3 != x4) and (d1 - x4 != d2 - x3) and (d1 - x4 != x3) and (x4 != d2 - x3) and (d1 - x4 != x4) and ( x3!= d2 - x3) and (d2 - x3 >0) and (d1 - x4 >0) :
print(d1-x4, d2-x3)
print(x3, x4)
hallado = False
break
if not hallado:
break
if hallado:
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;
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;
}
| 7 |
CPP
|
s = input().split()
r1 = int(s[0])
r2 = int(s[1])
s = input().split()
c1 = int(s[0])
c2 = int(s[1])
s = input().split()
d1 = int(s[0])
d2 = int(s[1])
b = (r1+d2-c1)
a = r1+d1-c2
d = r2+d1-c1
c = r2+d2-c2
if a%2!=0 or a<0 or a//2>9 or b%2!=0 or b<0 or b//2>9 or c%2!=0 or c<0 or c//2>9 or d%2!=0 or d<0 or d//2>9:
print(-1)
else:
has = [0 for i in range(10)]
has[a//2]+=1
has[b//2]+=1
has[c//2]+=1
has[d//2]+=1
res = True
for j in range(1,10):
if has[j]>1:
res = False
if not res or has[0]!=0:
print(-1)
else:
print(str(a//2)+" "+str(b//2))
print(str(c//2)+" "+str(d//2))
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
found = False
for i in range(1, 10):
if found:
break
for j in range(1, 10):
if found:
break
for k in range(1, 10):
if found:
break
for l in range(1, 10):
if i + j == r1 and k + l == r2 and i + l == d1 and j + k == d2 and i + k == c1 and j + l == c2:
if len(set([i, j, k, l])) == 4:
print(i, j)
print(k, l)
found = True
break
if not found:
print(-1)
| 7 |
PYTHON3
|
def intger (l):
ans=[]
for i in l :
ans.append(int(i))
return ans
r=intger(input().split())
c=intger(input().split())
d=intger(input().split())
from itertools import permutations
myFlag=False
for i in permutations(range(1,10),4):
if i[0]+i[1]==r[0] and i[2]+i[3]==r[1] and i[0]+i[2]==c[0] and i[1]+i[3]==c[1] and i[0]+i[3]==d[0] and i[1]+i[2]==d[1]:
print(i[0],i[1])
print(i[2],i[3])
myFlag=True
if not myFlag:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
ans = [r1 + c1 - d2, r1 + c2 - d1, c1 + r2 - d1, c2 + r2 - d2]
if any([x % 2 == 1 or x // 2 not in range(1, 10) for x in ans]) or len(set(ans)) != 4:
print(-1)
else:
ans = [x // 2 for x in ans]
print(*ans[:2])
print(*ans[2:])
| 7 |
PYTHON3
|
try:
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
a,b,c,d,=0,0,0,0
d=int((c2+r2-d2)/2)
a=int(d1-d)
b=int(c2-d)
c=int(r2-d)
if a!=b and a!=c and a!=d and b!=c and b!=d and c!=d and 0<a<10 and 0<b<10 and 0<c<10 and 0<d<10 and a+b==r1 and a+d==d1 and a+c==c1 and b+d==c2 and c+d==r2 and b+c==d2:
print(a,b)
print(c,d)
else:
print(-1)
except:
pass
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
res = []
for a in range(1,10,1):
b = r1-a
c = c1-a
d = r2-c
if a<=9 and a>=1 and b<=9 and b>=1 and c<=9 and c>=1 and d<=9 and d>=1:
if a+b == r1 and a+c == c1 and a+d == d1 and c+d == r2 and d+b == c2 and b+c == d2:
if len(set([a,b,c,d])) == 4:
print(str(a)+" "+str(b))
print(str(c)+" "+str(d))
exit()
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r=input().split()
c=input().split()
d=input().split()
def chick_list(l):
if l[0]+l[1]==int(r[0]) and l[2]+l[3]==int(r[1]) and l[0]+l[2]==int(c[0]) and l[1]+l[3]==int(c[1]) and l[0]+l[3]==int(d[0]) and l[1]+l[2]==int(d[1]):
return 1
return 0
ll=[0, 0, 0, 0]
for i in range(1,10):
ll[0] = i
for j in range(1,10):
if i==j:
continue
ll[1] = j
for k in range(1,10):
if k==j or k==i:
continue
ll[2]=k
for m in range(1,10):
if m==k or m==j or m==i:
continue
ll[3]=m
if chick_list(ll)==1:
print(ll[0],' ',ll[1] ,'\n' ,ll[2],' ',ll[3],sep='')
exit()
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;
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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
l=[]
for i in range(3) :
l+=list(map(int,input().split()))
for i in range(1,10) :
for j in range(1,10) :
for i1 in range(1,10) :
for j1 in range(1,10) :
if i+j==l[0] and i1+j1==l[1] and i+j1==l[4] and i+i1==l[2] and j+j1==l[3] and j+i1==l[5] :
l1=[i,j,i1,j1]
if len(set(l1))==4 :
print(i,j)
print(i1,j1)
exit()
print(-1)
| 7 |
PYTHON3
|
lock = [[0,0],[0,0]]
r1,r2 = map(int,input().split())
c1,c2 = map(int,input().split())
d1,d2 = map(int,input().split())
for i in range(1,10):
lock[0][0] = i
lock[0][1] = r1 -i
lock[1][0] = c1 - lock[0][0]
lock[1][1] = r2 - lock[1][0]
if lock[0][0] + lock[0][1] == r1 \
and lock[1][0] + lock[1][1] == r2\
and lock[0][0] + lock[1][0] == c1 \
and lock[0][1] + lock[1][1] == c2 \
and lock[0][0] + lock[1][1] == d1 \
and lock[1][0]+ lock[0][1] == d2:
if len(set(lock[1]).union(lock[0])) == 4 and (0< lock[0][0] <=9)and (0< lock[0][1] <=9) and (0< lock[1][1] <=9) and (0< lock[1][0] <=9):
print(lock[0][0] ,lock[0][1])
print(lock[1][0], lock[1][1])
break
if i ==9:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#!/usr/bin/env python
import os
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from io import BytesIO, IOBase
from itertools import (
accumulate, combinations, combinations_with_replacement, groupby,
permutations, product)
from math import (
acos, asin, atan, ceil, cos, degrees, factorial, hypot, log2, pi, radians,
sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits
def inp():
return(int(input()))
def inlist():
return(list(map(int, input().split())))
def instr():
s = input()
return(list(s[:len(s)]))
def invr():
return(map(int, input().split()))
def isAccepted(a1, a2, a3, a4, r1, r2, c1, c2, d1, d2):
temp = set()
temp.add(a1)
temp.add(a2)
temp.add(a3)
temp.add(a4)
if len(temp) < 4:
return False
for i in temp:
if i < 1 or i > 9:
return False
if a1+a2 == r1 and a3 + a4 == r2 and a1 + a3 == c1 and a2 + a4 == c2 and a1 + a4 == d1 and a2 + a3 == d2:
return True
else:
return False
def main():
# # For getting input from input.txt file
# sys.stdin = open('input.txt', 'r')
# # Printing the Output to output.txt file
# sys.stdout = open('output.txt', 'w')
r1, r2 = invr()
c1, c2 = invr()
d1, d2 = invr()
for i in range(1, 10):
a1 = i
a2 = r1 - a1
a3 = c1 - a1
a4 = r2 - a3
if isAccepted(a1, a2, a3, a4, r1, r2, c1, c2, d1, d2):
print(a1, a2)
print(a3, a4)
sys.exit()
print(-1)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
| 7 |
PYTHON3
|
#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");
}
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
def solve(r1,r2,c1,c2,d1,d2):
cel1 = 0
cel2 = 0
cel3 = 0
cel4 = 0
res = (d1+r1-c2)
another_res = c1+d1-r2
if res <1 or res%2 !=0 or res//2 > 9 or res != another_res:
print(-1)
return
cel1 = res //2
if r1-cel1 >9 or r1-cel1 < 1 or cel1 == r1-cel1:
print(-1)
return
cel2 = r1-cel1
if d2 - cel2 >9 or d2-cel2 <1 or cel2 == d2-cel2 or cel1 == d2-cel2:
print(-1)
return
cel3 = d2-cel2
if r2-cel3 > 9 or r2-cel3 <1 or cel3 == r2-cel3 or cel1 == r2-cel3 or cel2 == r2-cel3:
print(-1)
return
cel4 = r2-cel3
print(cel1, cel2)
print(cel3, cel4)
def main() :
# n = int(input())
# arr = list(map(int, input().split(' ')))
arr = []
for _ in range(3):
i = list(map(int, input().split(' ')))
arr += i
solve(*arr)
main()
| 7 |
PYTHON3
|
r1,r2 = list(map(int,input().split()))
c1,c2 = list(map(int,input().split()))
d1,d2 = list(map(int,input().split()))
res = True
for i in range(1,10):
u = r1-i
v = c1-i
w = d1-i
l = [i,u,v,w]
if min(l)>=1 and len(set(l))==4 and w+v==r2 and u+w==c2 and i+v==c1 and u+i==r1 and u+v==d2 and i+w==d1 and max(l)<=9:
print(i,u)
print(v,w)
res = False
break
if res:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
R=lambda:map(int,input().split())
r,S=R()
c,C=R()
d,D=R()
A=[(c+d-S)/2,(r+C-d)/2,(S+c-d)/2,(d+C-r)/2]
for i in range(4):
if A[i]!=int(A[i])or A[i]<1or A[i]>9or len(set(A))<4:
print(-1)
exit()
else:A[i]=int(A[i])
print(A[0],A[1])
print(A[2],A[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;
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;
}
| 7 |
CPP
|
r=list(map(int,input().split()))
c=list(map(int,input().split()))
d=list(map(int,input().split()))
X=0
for i in range(1,10):
ans1=[0,0]
ans2=[0,0]
if i<=d[0] and i<=r[0] and i<=c[0]:
ans1[0]=i
ans2[1]=d[0]-ans1[0]
ans1[1]=abs(r[0]-ans1[0])
if ans1[1]+ans2[1]==c[1]:
ans2[0]=abs(r[1]-ans2[1])
if ans1[0]>9 or ans1[1]>9 or ans2[0]>9 or ans2[1]>9 or len(set(ans1))!=2 and len(set(ans2))!=2 or ans1[0]==ans2[0] or ans1[1]==ans2[0] or ans1[0]==ans2[1] or ans1[1]==ans2[1] or 0 in ans1 or 0 in ans2:
print(-1)
X=1
elif len(set(ans1))==2 and len(set(ans2))==2 and ans2[0]+ans1[1]==d[1]:
print(*ans1,sep=' ')
print(*ans2,sep=' ')
X=1
else:
print(-1)
X=1
else:
continue
if X==0:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 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 = (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;
}
| 7 |
CPP
|
"""
βββ βββββββ βββ βββββββ βββββββ βββ ββββββ
βββββββββββββββ βββββββββββββββββββββββββββββ
ββββββ ββββββ ββββββββββββββββββββββββββββ
ββββββ ββββββ βββββββ βββββββββ βββ βββββββ
βββββββββββββββ βββββββββββββββββ βββ βββββββ
βββ βββββββ βββ ββββββββ βββββββ βββ ββββββ
βββββββ ββββββ βββββββββββ βββ βββββββ βββββββ
ββββββββββββββ βββββββββββ ββββββββββββββββββββ
βββ βββββββββ βββββββββββββββββββ ββββββ βββ
βββ βββββββββ βββββββββββββββββββ ββββββ βββ
ββββββββββββββββββββββββββββββ ββββββββββββββββββββ
βββββββ ββββββββββββββββββββββ βββ βββββββ βββββββ
"""
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
for a in range(1, 10):
for b in range(1, 10):
if a == b:
continue
for c in range(1, 10):
if b == c or a == c:
continue
for d in range(1, 10):
if d == a or d == b or d == c:
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:
print(a, b)
print(c, d)
exit()
print(-1)
| 7 |
PYTHON3
|
r1,r2 = map(int,input().split())
c1,c2 = map(int,input().split())
d1,d2 = map(int,input().split())
ans = []
a = (r1+c1-d2)//2
ans.append(a)
b = r1 - a
ans.append(b)
c = c1 - a
ans.append(c)
d = d1 - a
ans.append(d)
ans = list(set(ans))
if(len(ans)<4):
print(-1)
elif(ans[3]>9):
print(-1)
elif(a*b*c*d <=0):
print(-1)
elif(max(a,b,c,d)>9):
print(-1)
elif((c+d)!=r2 or (b+d)!=c2 or (c+b)!=d2):
print(-1)
else:
print(a,b)
print(c,d)
| 7 |
PYTHON3
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
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 i!=j and i!=k and i!=l and j!=k and j!=l and k!=l:
if r1==i+j and r2==k+l and c1==i+k and c2==j+l and d1==i+l and d2==j+k:
print(i,j)
print(k,l)
exit()
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r1 , r2 = map(int, input().split())
c1 , c2 = map(int, input().split())
d1 , d2 = map(int, input().split())
x = 1
for x00 in range(1,10):
for x01 in range(1,10):
if (x00==x01):
continue
for x10 in range(1,10):
if( (x10 == x00) | (x10 == x01) ):
continue
for x11 in range(1,10):
if((x11 == x00) | (x11 == x10) | (x11 == x01)):
continue
if((x00+x01 == r1)&(x10+x11 == r2)&(x00+x10 == c1)&(x01+x11 == c2)&(x00+x11 == d1)&(x01+x10 == d2)):
print(x00,x01)
print(x10,x11)
x = 0
break
if (x != 0):
print(-1)
| 7 |
PYTHON3
|
r1,r2=input().split()
c1,c2=input().split()
d1,d2=input().split()
r1=int(r1);r2=int(r2);c1=int(c1);c2=int(c2);d1=int(d1);d2=int(d2)
a=[[0 for i in range(2)]for j in range(2)]
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 i+j==r1 and l+k==r2 and i+l==c1 and j+k==c2 and i+k==d1 and j+l==d2 and i!=j and i!=k and i!=l and j!=k and j!=l and l!=k:
a[0][0]=i
a[0][1]=j
a[1][0]=l
a[1][1]=k
flag=1
for i in range(2):
for j in range(2):
if a[i][j]==0:
flag=flag*1
else:
flag=0
if flag==1:
print('-1')
else:
print(a[0][0],end=' ')
print(a[0][1])
print(a[1][0],end=' ')
print(a[1][1])
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
import itertools
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
l=list(range(1,10))
c=itertools.permutations(l,4)
f=0
for i in c:
#print(i)
if((i[0]+i[1]==r1) and (i[2]+i[3]==r2) and (i[0]+i[2]==c1) and (i[1]+i[3]==c2) and (i[0]+i[3]==d1) and (i[1]+i[2]==d2)):
print(i[0],i[1])
print(i[2],i[3])
f=1
break
if(f==0):
print(-1)
| 7 |
PYTHON3
|
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:
ans=True
print(w,x)
print(y,z)
break
if not ans:
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
r1,r2 = map(int,input().split())
c1,c2 = map(int,input().split())
d1,d2 = map(int,input().split())
digits = [i for i in range(1,10)]
n = 9
def good_combo(dig1,dig2,dig3,dig4):
row1 = (r1 == dig1 + dig2)
row2 = (r2 == dig3 + dig4)
col1 = (c1 == dig1 + dig3)
col2 = (c2 == dig2 + dig4)
diag1 = (d1 == dig1 + dig4)
diag2 = (d2 == dig2 + dig3)
return (row1 and row2 and col1 and col2 and diag1 and diag2)
def solve():
for p1 in range(n):
for p2 in range(n):
for p3 in range(n):
for p4 in range(n):
if len(set([p1,p2,p3,p4])) == 4:
dig1,dig2,dig3,dig4 = digits[p1],digits[p2],digits[p3],digits[p4]
if good_combo(dig1,dig2,dig3,dig4):
print(dig1,dig2)
print(dig3,dig4)
return
print(-1)
solve()
| 7 |
PYTHON3
|
r1, r2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
x1 = (c1 + d2 - r1)
if x1 % 2 == 1:
print(-1)
else:
x = x1 // 2
y = r2 - x
v = d1 - y
w = r1 - v
daf = [x, y, v, w]
set_gem = {1, 2, 3, 4, 5, 6, 7, 8, 9}
flag = True
for gem in daf:
if gem in set_gem:
set_gem.remove(gem)
else:
flag = False
break
if not flag:
print(-1)
else:
print(v, w)
print(x, y)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
inp1=input().split()
inp2=input().split()
inp3=input().split()
r1=int(inp1[0])
r2=int(inp1[1])
c1=int(inp2[0])
c2=int(inp2[1])
d1=int(inp3[0])
d2=int(inp3[1])
flag=0
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(i+j==r1 and k+l==r2 and i+l==d1 and k+j==d2 and i+k==c1 and l+j==c2 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
flag=1
break
if(flag==1):
break
if(flag==1):
break
if(flag==1):
break
if(flag==0):
print(-1)
else:
print(str(a)+' '+str(b))
print(str(c)+' '+str(d))
| 7 |
PYTHON3
|
I=lambda:map(int,input().split())
R=list(range(1,10))
P=print
q,w=I()
e,r=I()
t,y=I()
z=[(a,b,c,d)for a in R for b in R for c in R for d in R if len(set((a,b,c,d)))>3 and a+b==q and c+d==w and a+c==e and b+d==r and a+d==t and b+c==y]
if z:z=z[0];P(z[0],z[1]);P(z[2],z[3])
else:P(-1)
| 7 |
PYTHON3
|
r1,r2 = map(int, input().split())
c1,c2 = map(int, input().split())
d1,d2 = map(int, input().split())
done = 0
for a1 in range(1,10):
a2 = r1 - a1
if a2 < 1 or a2>9 or a2== a1:
continue
a3 = c1 - a1
if a3 < 1 or a3>9 or a3 == a1 or a3==a2:
continue
a4 = c2 - a2
if a4 < 1 or a4>9 or a4==a1 or a4 == a2 or a4==a3:
continue
if a1+a4 != d1:
continue
if a2+a3 != d2 :
continue
if a3+a4 != r2 :
continue
print(a1,a2)
print(a3,a4)
done=1
break
if done==0:
print(-1)
# Wed Oct 14 2020 14:04:54 GMT+0300 (ΠΠΎΡΠΊΠ²Π°, ΡΡΠ°Π½Π΄Π°ΡΡΠ½ΠΎΠ΅ Π²ΡΠ΅ΠΌΡ)
| 7 |
PYTHON3
|
import sys
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
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(i+j==r1 and i+k==c1 and k+l==r2 and j+l==c2 and i+l==d1 and j+k==d2):
set1=set([i,j,k,l])
if(len(set1)==4):
print(i,j)
print(k,l)
f=1
sys.exit()
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 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()]
count=0
for i in range(1,10):
if count==1:
break
a=i
for j in range(1,10):
if count==1:
break
b=j
for k in range(1,10):
if count==1:
break
c=k
for l in range(1,10):
d=l
if r1==a+b and r2==c+d and c1==a+c and c2==b+d and d1==a+d and d2==c+b:
count=1
break
if count==0:
print(-1)
if count==1 :
if len(set([a,b,c,d]))==4:
print(a,b)
print(c,d)
else:
print(-1)
| 7 |
PYTHON3
|
l1, l2 = map(int, input().split())
c1, c2 = map(int, input().split())
d1, d2 = map(int, input().split())
def validar(box):
if box[0] + box[1] == l1 \
and box[2] + box[3] == l2 \
and box[0] + box[2] == c1 \
and box[1] + box[3] == c2 \
and box[0] + box[3] == d1 \
and box[1] + box[2] == d2:
for i in range(4):
for j in range(i+1, 4):
if box[j] == box[i]: return False
return True
return False
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 validar([i, j, k, l]):
print(f"{i} {j}\n{k} {l}\n")
exit(0)
print(-1)
| 7 |
PYTHON3
|
#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;
}
| 7 |
CPP
|
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())
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 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 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");
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
#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;
}
| 7 |
CPP
|
R = list(map(int, input().split()))
C = list(map(int, input().split()))
D = list(map(int, input().split()))
X = [(D[0] + C[0] - R[1]) // 2, (R[0] + C[1] - D[0]) // 2]
Y = [(D[1] + C[0] - R[0]) // 2, (R[1] + C[1] - D[1]) // 2]
if len(set(X + Y)) != 4 or any([True for i in X + Y if i>9 or i<=0]):
print(-1)
else:
print(*X)
print(*Y)
# A new start
# Here in Tabas
# Waiting for the big news
| 7 |
PYTHON3
|
r1,r2=map(int,input().split())
c1,c2=map(int,input().split())
d1,d2=map(int,input().split())
import sys
if (r1+d1-c2)%2==1:
print(-1)
sys.exit()
else :
a=(r1+d1-c2)//2
b=r1-a
d=d1-a
c=r2-d
l1=[a,b,c,d]
if a<=0 or b<=0 or c<=0 or d<=0 or a>9 or b>9 or c>9 or d>9 or(a+b)!=r1 or (c+d)!=r2 or (a+d)!=d1 or (b+c)!=d2 or (a+c)!=c1 or (b+d)!=c2:
print(-1)
sys.exit()
if l1.count(l1[0])==1 and l1.count(l1[1])==1 and l1.count(l1[2])==1 and l1.count(l1[3])==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())
c=((c1-d1)+r2)//2
b=((r1-c1)+d2)//2
a=r1-b
d=d1-a
e={a,b,c,d}
if len(e)==4 and 10>a>0 and 10>b>0 and 10>c>0 and 10>d>0:
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)
else: print(-1)
else: print(-1)
"""
a+b=r1 c+d=r2
a+c=c1 b+d=c2
a+d=d1 b+c=d2
b-c=r1-c1 c-b=r2-c2
b+c=d2
2b=(r1-c1)+d2
c-d=c1-d1
c+d=r2
2c=(c1-d1)+r2
"""
| 7 |
PYTHON3
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.