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 :
pri... | 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-... | 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')
... | 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] =... | 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 ... | 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 && ... | 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 > ... | 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... | 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 =... | 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 !... | 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 ... | 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 ==... | 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... | 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;
c... | 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 || ... | 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:
cont... | 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)
... | 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:
... | 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 && ... | 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;... | 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,... | 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... | 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... | 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]... | 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 == r... | 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.appe... | 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... | 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 +... | 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):
... | 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 x... | 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 ==... | 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;... | 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 && ... | 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 && ... | 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])... | 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";... | 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==... | 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;... | 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 != a... | 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 + d... | 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 && x... | 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)
... | 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 ==... | 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... | 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... | 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... | 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 ... | 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... | 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[... | 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 == ... | 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... | 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 ... | 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 a... | 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... | 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 = ... | 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
... | 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 > ... | 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 ... | 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 ... | 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 != a... | 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... | 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... | 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 /... | 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 fu... | 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++... | 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... | 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): contin... | 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... | 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 == ... | 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 |... | 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;
... | 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 ... | 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:
x... | 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 <... | 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 thr... | 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... | 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 ... | 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[... | 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... | 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++) {
... | 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 lon... | 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... | 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++)
... | 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... | 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;
... | 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
... | 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;
... | 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)... | 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)++)
f... | 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 + ... | 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)
... | 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... | 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(... | 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++;
... | 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 &&
... | 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)
# ... | 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 + ... | 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 !... | 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.