description stringlengths 171 4k | code stringlengths 94 3.98k | normalized_code stringlengths 57 4.99k |
|---|---|---|
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | k = int(input())
s = str(input())
t = str(input())
a, b, m = [], [], []
p, d = 0, 0
for i in range(k - 1, -1, -1):
a.append(ord(s[i]) - ord("a"))
b.append(ord(t[i]) - ord("a"))
a[k - 1 - i] += b[k - 1 - i] + d
d = a[k - 1 - i] // 26
if i != 0:
a[k - 1 - i] %= 26
carry = 0
for i in range(k - ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR LIST LIST LIST ASSIGN VAR VAR NUMBER NUMBER FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR STRING EXPR FUNC_CALL VA... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | a = int(input())
b = [(ord(i) - 97) for i in input()[::-1]]
c = [(ord(i) - 97) for i in input()[::-1]]
it = b[0] + c[0]
s = []
for i in range(1, a):
it += 26 * (b[i] + c[i])
s.append(chr(it // 2 % 26 + 97))
it //= 26
s.append(chr(it // 2 % 26 + 97))
s = "".join(s[::-1])
print(s) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER VAR VAR BIN_OP NUMBER BIN_OP VAR VAR VAR VAR EXPR FUNC_CALL ... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | def main():
n = int(input())
s = [(ord(c) - ord("a")) for c in input()]
t = [(ord(c) - ord("a")) for c in input()]
r = [(s[i] + t[i]) for i in range(n)]
for i in range(n - 1, 0, -1):
if r[i] >= 26:
r[i] -= 26
r[i - 1] += 1
k = 0
rs = [0] * n
for i in range... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER NUMBER IF VAR VAR N... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | k = int(input())
s = input().strip()
t = input().strip()
num_2 = list(map(ord, s))
num_1 = list(map(ord, t))
for i in range(k):
num_1[i] -= 97
num_2[i] -= 97
def plus(num_1, num_2):
res = [0] * (len(num_1) + 1)
memory = 0
num_1.reverse()
num_2.reverse()
for i in range(len(num_1)):
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR FOR VAR FUNC_CALL VAR VAR VAR VAR NUMBER VAR VAR NUMBER FUNC_DEF ASSIGN VAR BIN_OP LIST NUMBER BIN_OP FUNC_CALL VAR V... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | N = int(input())
s1 = [(ord(i) - ord("a")) for i in input()[::-1]]
s2 = [(ord(i) - ord("a")) for i in input()[::-1]]
res = []
temp = s1[0] + s2[0]
for i in range(1, N):
temp += (s1[i] + s2[i]) * 26
res.append(chr(temp // 2 % 26 + ord("a")))
temp //= 26
res.append(chr(temp // 2 % 26 + ord("a")))
print("".joi... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR NUMBER ASSIGN VAR LIST ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR VAR BIN_OP BIN_OP VAR VAR VA... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | alphabet = "abcdefghijklmnopqrstuvwxyz"
alphabet_d = {}
for i, c in enumerate(alphabet):
alphabet_d[c] = i
def transform_string(s):
n = len(s)
res = [0]
for i in range(n):
res.append(alphabet_d[s[i]])
return res
k = int(input())
s = input()
t = input()
s = transform_string(s)
t = transfo... | ASSIGN VAR STRING ASSIGN VAR DICT FOR VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR LIST NUMBER FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR VAR VAR VAR RETURN VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CAL... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | indexes = {}
alpha = "abcdefghijklmnopqrstuvwxyz"
for i in alpha:
indexes[i] = alpha.index(i)
n = int(input())
first = [indexes[x] for x in input()]
second = [indexes[x] for x in input()]
third = [0] * n
carry = 0
for i in range(n - 1, -1, -1):
tempResp = first[i] + second[i] + carry
if i != 0 and tempResp ... | ASSIGN VAR DICT ASSIGN VAR STRING FOR VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER NUMBER NUMBER ASSIGN VAR BIN_OP BIN_... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | def next_int():
return int(input())
def next_int_list():
return [int(i) for i in input().split(" ")]
def next_float():
return float(input())
def next_float_list():
return [int(i) for i in input().split(" ")]
def next_string():
return input()
def print_int_list(l):
print(" ".join([str(i... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING FUNC_DEF RETURN FUNC_CALL VAR FUNC_DEF EXPR FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR VAR V... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | k = int(input())
s1 = input()
s2 = input()
a1 = []
a2 = []
delta = []
for i in range(k):
a1.append(ord(s1[i]) - 97)
a2.append(ord(s2[i]) - 97)
delta.append(a2[i] + a1[i])
for i in range(k - 1):
delta[i + 1] += 26 * (delta[i] % 2)
delta[i] = delta[i] // 2
delta[k - 1] = delta[k - 1] // 2
i = k - 1
wh... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST ASSIGN VAR LIST ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER EXPR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR VAR VAR FOR V... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | def stringToBase(string, K):
base = []
for i in range(0, K):
base += [ord(string[i]) - ord("a")]
return base
def getMedian(stringA, stringB, K):
baseA = stringToBase(stringA, K)
baseB = stringToBase(stringB, K)
baseResult = []
for i in range(0, K):
baseResult += [0]
for... | FUNC_DEF ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER VAR VAR LIST BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR STRING RETURN VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER VAR VAR LIST NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR ASSIGN VAR BIN_OP B... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | k = int(input())
s = input()
t = input()
s = [(ord(s[i]) - ord("a")) for i in range(k)]
t = [(ord(t[i]) - ord("a")) for i in range(k)]
res = [0] * (k + 1)
add = 0
for i in range(k - 1, -1, -1):
sum = t[i] + s[i] + add
add = sum // 26
res[i + 1] = sum % 26
res[0] = add
add = 0
ans = []
for i in range(k + 1):... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP LIST NUMBER BIN_OP VAR NUMBER ASSIGN VAR NUMBER... |
You are given two strings $s$ and $t$, both consisting of exactly $k$ lowercase Latin letters, $s$ is lexicographically less than $t$.
Let's consider list of all strings consisting of exactly $k$ lowercase Latin letters, lexicographically not less than $s$ and not greater than $t$ (including $s$ and $t$) in lexicograp... | n = int(input())
a = input()
b = input()
ch_a = []
ch_b = []
ch_re = [0] * n
for i in range(n):
ch_a.append(int(ord(a[i]) - ord("a")))
ch_b.append(int(ord(b[i]) - ord("a")))
flag = 0
for i in range(n - 1, -1, -1):
temp = ch_a[i] + ch_b[i] + flag
ch_re[i] = temp % 26
flag = temp // 26
if flag == 1:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR LIST ASSIGN VAR LIST ASSIGN VAR BIN_OP LIST NUMBER VAR FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR STRING EXPR FUNC_CALL VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def solve(K, A, B, C):
a = list(bin(A)[2:])
b = list(bin(B)[2:])
c = list(bin(C)[2:])
l = max(map(len, (a, b, c)))
a = ["0"] * (l - len(a)) + a
b = ["0"] * (l - len(b)) + b
c = ["0"] * (l - len(c)) + c
for i in range(len(c)):
if c[i] == "0":
if a[i] != "0":
... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP LIST STRING BIN_OP VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP LIST STRING... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
from itertools import chain
input = sys.stdin.readline
def fit(l):
return lambda x: x + ["0"] * (l - len(x))
def hex_to_list(x):
return list(
chain.from_iterable(
[bool(n & 1 << i) for i in range(4)]
for n in [int(xx, 16) for xx in reversed(x)]
)
)
d... | IMPORT ASSIGN VAR VAR FUNC_DEF RETURN BIN_OP VAR BIN_OP LIST STRING BIN_OP VAR FUNC_CALL VAR VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR BIN_OP NUMBER VAR VAR FUNC_CALL VAR NUMBER VAR FUNC_CALL VAR VAR NUMBER VAR FUNC_CALL VAR VAR FUNC_DEF RETURN FUNC_CALL FUNC_CALL STRING FUNC_CALL FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def adjust(a, b, c, k):
for i in range(4):
if c & 1 << i and not (a | b) & 1 << i:
b |= 1 << i
k -= 1
elif not c & 1 << i:
if a & 1 << i:
a ^= 1 << i
k -= 1
if b & 1 << i:
b ^= 1 << i
k -=... | FUNC_DEF FOR VAR FUNC_CALL VAR NUMBER IF BIN_OP VAR BIN_OP NUMBER VAR BIN_OP BIN_OP VAR VAR BIN_OP NUMBER VAR VAR BIN_OP NUMBER VAR VAR NUMBER IF BIN_OP VAR BIN_OP NUMBER VAR IF BIN_OP VAR BIN_OP NUMBER VAR VAR BIN_OP NUMBER VAR VAR NUMBER IF BIN_OP VAR BIN_OP NUMBER VAR VAR BIN_OP NUMBER VAR VAR NUMBER RETURN VAR NUMB... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for _ in range(Q):
k = int(input())
A = bin(int(input(), 16))[2:]
B = bin(int(input(), 16))[2:]
C = bin(int(input(), 16))[2:]
l = max(len(A), len(B), len(C))
A = list("0" * (l - len(A)) + A)
B = list("0" * (l - len(B)) + B)
C = list("0" * (l - len(C)) + C)
for i in r... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input().strip())
for a0 in range(Q):
k = int(input())
a, b, c = [input() for _ in range(3)]
m = max(len(x) for x in (a, b, c))
a = "0" * (m - len(a)) + a
b = "0" * (m - len(b)) + b
c = "0" * (m - len(c)) + c
ra = ""
rb = ""
for da, db, dc in zip(a, b, c):
da = int(da,... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
K = int(input())
A, B, C = input().strip(), input().strip(), input().strip()
a = bin(int(A, 16))[2:]
b = bin(int(B, 16))[2:]
c = bin(int(C, 16))[2:]
mx = max(len(a), len(b), len(c))
k = 0
a = list(map(int, list("0" * (mx - len(a)) + a)))
b = list(map(int... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR F... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
Q = int(input().strip())
def printHex(A, B):
print(hex(int("".join(A), 2)).upper()[2:])
print(hex(int("".join(B), 2)).upper()[2:])
for t in range(Q):
k = int(input().strip())
A = list(bin(int(input().strip(), 16))[2:])
B = list(bin(int(input().strip(), 16))[2:])
C = list(bin(int(... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF EXPR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL STRING VAR NUMBER NUMBER EXPR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL STRING VAR NUMBER NUMBER FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
K = int(input())
A = int(input(), 16)
B = int(input(), 16)
C = int(input(), 16)
liczba = (
bin((A | B) ^ C).count("1") + bin(A & B).count("1") - bin(A & B & C).count("1")
)
if liczba > K:
print(-1)
else:
X = (A | B) ^ C
Y = X ... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP BIN_OP FUNC_CALL FUNC_CALL VAR BIN_OP BIN_OP VAR VAR VAR STRING FUNC_CALL F... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def solve(a, b, c, k):
a = "{0:b}".format(int(a, 16))
b = "{0:b}".format(int(b, 16))
c = "{0:b}".format(int(c, 16))
l = max(len(a), len(b), len(c))
a = "0" * (l - len(a)) + a
b = "0" * (l - len(b)) + b
c = "0" * (l - len(c)) + c
a = [int(x) for x in a]
b = [int(x) for x in b]
c =... | FUNC_DEF ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR VAR VAR ASSIGN V... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input().strip())):
num_changes = 0
K, A, B, C = (
int(input().strip()),
list("{0:b}".format(int(input(), 16))),
list("{0:b}".format(int(input(), 16))),
list("{0:b}".format(int(input(), 16))),
)
max_length = max(len(A), len(B), len(C))
A, B, C = (
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def leftpad(s, n):
padlen = n - len(s)
return "0" * padlen + s
def solve(k, a, b, c):
changed = 0
ap = ""
bp = ""
for x, y, z in zip(a, b, c):
x = int(x, 16)
y = int(y, 16)
z = int(z, 16)
p = 1
while p < 16:
if z & p == 0:
if ... | FUNC_DEF ASSIGN VAR BIN_OP VAR FUNC_CALL VAR VAR RETURN BIN_OP BIN_OP STRING VAR VAR FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR STRING ASSIGN VAR STRING FOR VAR VAR VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR NUMBER WHIL... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for __ in range(Q):
K = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
maxlength = max(len(a), len(b), len(c))
a = list(map(int, a.rjust(maxlength, "0")))
b = list(map(int, b.rjust(maxlength, "0")))
c = list(map(int... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
Q = int(input().strip())
def boolify(s, length, mlength):
res = [False] * (4 * mlength)
k = mlength - length
for i in range(0, length):
x = int(s[i], 16)
res[4 * k + 0] = x & 8 != 0
res[4 * k + 1] = x & 4 != 0
res[4 * k + 2] = x & 2 != 0
res[4 * k + 3] =... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR BIN_OP LIST NUMBER BIN_OP NUMBER VAR ASSIGN VAR BIN_OP VAR VAR FOR VAR FUNC_CALL VAR NUMBER VAR ASSIGN VAR FUNC_CALL VAR VAR VAR NUMBER ASSIGN VAR BIN_OP BIN_OP NUMBER VAR NUMBER BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP NUMBER VAR NUMB... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
def solve(a, b, c, k, debug=0):
if debug > 0:
print("a=%s b=%s c=%s k=%d" % (a, b, c, k), file=sys.stderr)
mx = max(len(a), len(b), len(c))
a = "0" * (mx - len(a)) + a
b = "0" * (mx - len(b)) + b
c = "0" * (mx - len(c)) + c
mp = {
("0", "0", "0"): (0, "0", "0"),
... | IMPORT FUNC_DEF NUMBER IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP STRING VAR VAR VAR VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP BIN... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for a in range(Q):
k = int(input())
A = "{0:b}".format(int(input(), 16))
B = "{0:b}".format(int(input(), 16))
C = "{0:b}".format(int(input(), 16))
len_A = len(A)
len_B = len(B)
len_C = len(C)
max_len = max(len_A, len_B, len_C)
A = list("0" * (max_len - len_A) + A)
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for _ in range(Q):
K = int(input())
A = bin(int(input(), 16))[2:]
B = bin(int(input(), 16))[2:]
C = bin(int(input(), 16))[2:]
max_lth = max(len(A), len(B), len(C))
max_lth += max_lth % 8
A = list(A.rjust(max_lth, "0"))
B = list(B.rjust(max_lth, "0"))
C = list(C.rjust... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def first_pass(A, B, C, k):
Ad = ""
Bd = ""
cnt = 0
for i, (a, b, c) in enumerate(zip(A, B, C)):
if int(a) | int(b) != int(c):
if c == "0":
Ad += "0"
Bd += "0"
if a == b == "1":
cnt += 2
else:
... | FUNC_DEF ASSIGN VAR STRING ASSIGN VAR STRING ASSIGN VAR NUMBER FOR VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR IF BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR IF VAR STRING VAR STRING VAR STRING IF VAR VAR STRING VAR NUMBER VAR NUMBER VAR STRING VAR STRING VAR NUMBER IF VAR VAR RETURN NUMBER... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def char_to_binary(ch):
val = ord(ch)
if val <= ord("9"):
val -= ord("0")
else:
val = val - ord("A") + 10
ret = [0] * 4
for i in range(3, -1, -1):
ret[i] = val & 1
val >>= 1
return ret
def binary_to_char(ar):
first_not_found = True
ll = len(ar)
ll //... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR IF VAR FUNC_CALL VAR STRING VAR FUNC_CALL VAR STRING ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR STRING NUMBER ASSIGN VAR BIN_OP LIST NUMBER NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER NUMBER ASSIGN VAR VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | from sys import stderr
Q = int(input())
for _ in range(Q):
K = int(input())
A = int(input(), 16)
B = int(input(), 16)
C = int(input(), 16)
badbits = (A | B) ^ C
badonesC = C & badbits
badonesA = A & (badbits ^ badonesC)
badonesB = B & (badbits ^ badonesC)
if badonesC:
n = bi... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def read_int():
return int(input().strip())
def read_string():
return str(input().strip())
HEX_BIN = {
"0": (0, 0, 0, 0),
"1": (0, 0, 0, 1),
"2": (0, 0, 1, 0),
"3": (0, 0, 1, 1),
"4": (0, 1, 0, 0),
"5": (0, 1, 0, 1),
"6": (0, 1, 1, 0),
"7": (0, 1, 1, 1),
"8": (1, 0, 0, 0)... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def transform(a, b, c):
changes = 0
if c == "0":
if a == "1":
changes += 1
if b == "1":
changes += 1
return "0", "0", changes
if a == "1" or b == "1":
return a, b, 0
return "0", "1", 1
for _ in range(int(input())):
k = int(input())
A, B, ... | FUNC_DEF ASSIGN VAR NUMBER IF VAR STRING IF VAR STRING VAR NUMBER IF VAR STRING VAR NUMBER RETURN STRING STRING VAR IF VAR STRING VAR STRING RETURN VAR VAR NUMBER RETURN STRING STRING NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for x in range(int(input())):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
mv = max(len(a), len(b), len(c))
while len(a) < mv:
a = "0" + a
while len(b) < mv:
b = "0" + b
while len(c) < mv:
c = "0" + c
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
K = int(input())
A = bin(int(input(), 16))[2:]
B = bin(int(input(), 16))[2:]
C = bin(int(input(), 16))[2:]
A1 = ""
B1 = ""
k = 0
l = max(len(A), len(B), len(C))
A = "0" * (l - len(A)) + A
B = "0" * (l - len(B)) + B
C = "0" * (l - len(C)) + C
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR STRING ASSIGN VAR S... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for t in range(int(input())):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
if len(a) > len(b):
b = "0" * (len(a) - len(b)) + b
else:
a = "0" * (len(b) - len(a)) + a
if len(a) > len(c):
c = "0" * (len(a) - l... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER IF FUNC_CALL VAR VAR FUNC_CALL... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for T in range(int(input())):
k = int(input())
a = input()
b = input()
c = input()
A = [x for x in bin(int(a, 16))[2:]]
B = [x for x in bin(int(b, 16))[2:]]
C = [x for x in bin(int(c, 16))[2:]]
length = [len(A), len(B), len(C)]
m = max(length)
A = ["0" for i in range(m - length[0... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR VAR VAR FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for _ in range(Q):
K = int(input())
A = int(input(), 16)
B = int(input(), 16)
C = int(input(), 16)
if K == 0:
if A | B == C:
print("{:X}".format(A))
print("{:X}".format(B))
else:
print(-1)
continue
M = max(A, B, C)
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER IF VAR NUMBER IF BIN_OP VAR VAR VAR EXPR FUNC_CALL VAR FUNC_CALL STRING VAR EX... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | bin_hex = {
"0000": "0",
"0001": "1",
"0010": "2",
"0011": "3",
"0100": "4",
"0101": "5",
"0110": "6",
"0111": "7",
"1000": "8",
"1001": "9",
"1010": "A",
"1011": "B",
"1100": "C",
"1101": "D",
"1110": "E",
"1111": "F",
}
hex_bin = {
"0": "0000",
"... | ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING S... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
for _ in range(q):
k = int(input())
a = list(bin(int(input(), 16))[2:])
b = list(bin(int(input(), 16))[2:])
c = list(bin(int(input(), 16))[2:])
max_length = max(len(a), len(b), len(c))
a = ["0"] * (max_length - len(a)) + a
b = ["0"] * (max_length - len(b)) + b
c = ["0"] ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR F... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | n = int(input().strip())
def numbits(i):
return bin(i).count("1")
for _ in range(n):
k = int(input().strip())
a = int(input().strip(), 16)
b = int(input().strip(), 16)
c = int(input().strip(), 16)
wrongbits = c ^ (a | b)
turnoff_a = wrongbits & a
turnoff_b = wrongbits & b
turnon ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR VAR STRING FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CAL... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def eat():
ret = bin(int("A" + input(), 16))[2:]
ret = [int(_) for _ in ret]
return ret[4:]
def prt(a):
b = "".join([str(_) for _ in a])
print("%X" % int(b, 2))
def app(a, n):
if len(a) == n:
return
a.reverse()
while len(a) < n:
a.append(0)
a.reverse()
q = int(i... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP STRING FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR VAR RETURN VAR NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR VAR VAR VAR EXPR FUNC_CALL VAR BIN_OP STRING FUNC_CALL VAR VAR NUMBER FUNC_DEF IF FUNC_CALL VAR VAR VAR RETURN EXPR FUNC_CAL... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | c = {
"0": "0000",
"1": "0001",
"2": "0010",
"3": "0011",
"4": "0100",
"5": "0101",
"6": "0110",
"7": "0111",
"8": "1000",
"9": "1001",
"A": "1010",
"B": "1011",
"C": "1100",
"D": "1101",
"E": "1110",
"F": "1111",
}
d = {}
for i in c:
d[c[i]] = i
for i... | ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING ASSIGN VAR DICT FOR VAR VAR ASSIGN VAR VAR VAR VAR FOR VAR FUNC_CALL VAR FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
Q = int(sys.stdin.readline())
while Q:
K = int(sys.stdin.readline())
A = int(sys.stdin.readline(), 16)
B = int(sys.stdin.readline(), 16)
C = int(sys.stdin.readline(), 16)
A2 = A & C
B2 = B & C
B3 = B2 | C & ~A2
K -= bin(A ^ A2).count("1") + bin(B ^ B3).count("1")
A3 = bin... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR WHILE VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR BIN_OP VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
la = len(a)
lb = len(b)
lc = len(c)
lm = max(la, lb, lc)
a = "0" * (lm - la) + a
b = "0" * (lm - lb) + b
c = "0" * (lm - lc) + c
a = [(... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR VAR A... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def one_count(s):
return bin(s).count("1")
nq = int(input().strip())
for i in range(nq):
k = int(input().strip())
a, b, c = [int(input().strip(), 16) for i in range(3)]
t1_mask = (a ^ b) & ~c
t2_mask = a & b & ~c
t3_mask = ~(a | b) & c
c = [one_count(x) for x in [t1_mask, t2_mask, t3_mask]... | FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR VAR STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR ASSIGN VAR BIN_OP B... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for i in range(0, Q):
K = int(input())
A = int(input(), 16)
B = int(input(), 16)
C = int(input(), 16)
length = max(len(bin(A)), len(bin(B)), len(bin(C))) - 2
diff = C ^ (A | B)
basic = bin(diff).count("1") + bin(A & B & ~C).count("1")
if basic > K:
print(-1)
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
for t in range(q):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
l = max(len(a), len(b), len(c))
a = (l - len(a)) * "0" + a
b = (l - len(b)) * "0" + b
c = (l - len(c)) * "0" + c
a_new = ""
b_new = ""
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input().strip())):
K = int(input().strip())
A = int(input().strip(), 16)
B = int(input().strip(), 16)
C = int(input().strip(), 16)
biggest = max(max(A, B), C)
fill_len = len(bin(biggest)) - 2
__A = list(bin(A)[2:].zfill(fill_len))
__B = list(bin(B)[2:].zfill(fill_len))... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
for _ in range(q):
k = int(input())
a = input()
b = input()
c = input()
m = max(len(a), len(b), len(c))
a = list(a.zfill(m))
b = list(b.zfill(m))
oa = a.copy()
ob = b.copy()
c = list(c.zfill(m))
runningTotalChanges = 0
changesA = [0] * m
changesB = [0... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CAL... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
nbits = max(len(a), len(b), len(c))
a = "0" * (nbits - len(a)) + a
b = "0" * (nbits - len(b)) + b
c = "0" * (nbits - len(c)) + c
a = [(ord(x) - 48)... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
k = int(input())
a, b, c = (list(input()) for _ in range(3))
max_len = max(len(num) for num in (a, b, c))
a, b, c = (["0"] * (max_len - len(num)) + num for num in (a, b, c))
for i in range(max_len):
a_i, b_i, c_i = (int(num, 16) for num in (a[i], b[i], c[i]))
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR VAR VAR ASSIGN VAR VAR VAR BIN_OP BIN_OP LIST STRING BIN_OP VAR FUNC_CALL VAR VAR VAR VAR VAR VAR VAR FOR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | total = 0
Q = int(input())
for iets in range(Q):
K = int(input())
A = list(format(int(input(), 16), "0>200006b"))
B = list(format(int(input(), 16), "0>200006b"))
C = format(int(input(), 16), "0>200006b")
for index in range(200006):
if C[index] == "0":
if A[index] == "1":
... | ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL V... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def fun(K, ABC):
abc = []
l = max([len(i) for i in ABC])
for i in ABC:
abc.append(list(bin(int(i, 16))[2:].zfill(4 * l)))
for i in range(4 * l):
if abc[0][i] == "0" and abc[1][i] == "0" and abc[2][i] == "1":
abc[1][i] = "1"
K -= 1
if abc[0][i] == "0" and a... | FUNC_DEF ASSIGN VAR LIST ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR FOR VAR VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER BIN_OP NUMBER VAR FOR VAR FUNC_CALL VAR BIN_OP NUMBER VAR IF VAR NUMBER VAR STRING VAR NUMBER VAR STRING VAR NUMBER VAR STRING ASSIGN VAR NUMBE... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def change_the_bits_and_print(A, B, C, k):
L = max(A, B, C).bit_length()
one = "1"
zero = "0"
bA = "0" * (L - A.bit_length()) + bin(A)[2:]
bB = "0" * (L - B.bit_length()) + bin(B)[2:]
bC = "0" * (L - C.bit_length()) + bin(C)[2:]
A_p = []
B_p = []
bits_changed_successfully = True
... | FUNC_DEF ASSIGN VAR FUNC_CALL FUNC_CALL VAR VAR VAR VAR ASSIGN VAR STRING ASSIGN VAR STRING ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
k = int(input())
A = "{0:b}".format(int(input(), 16))
B = "{0:b}".format(int(input(), 16))
C = "{0:b}".format(int(input(), 16))
l = max([len(A), len(B), len(C)])
A = "0" * (l - len(A)) + A
B = "0" * (l - len(B)) + B
C = "0" * (l - len(C)) + C
a = []
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR LIST FUNC_CALL VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | t = int(input())
for i in range(t):
count = 0
k = int(input())
a = bin(int(input(), 16))
b = bin(int(input(), 16))
c = input()
num = len(c) * 4
c = bin(int(c, 16))[2:].zfill(num)
a = list(a[2:].zfill(num))
b = list(b[2:].zfill(num))
for j in range(num):
if c[j] == "0" and... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | for _ in range(int(input())):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
m = max(len(a), len(b), len(c))
a = list(a.zfill(m))
b = list(b.zfill(m))
c = list(c.zfill(m))
for i in range(len(a)):
if c[i] == "0":
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
def first_pass(a, b, c, k):
i = 0
while i < len(a):
if a[i] is "0" and b[i] is "1" and c[i] is "0":
k -= 1
if k < 0:
return -1
b[i] = "0"
elif a[i] is "1" and b[i] is "0" and c[i] is "0":
k -= 1
if k < 0:
... | IMPORT FUNC_DEF ASSIGN VAR NUMBER WHILE VAR FUNC_CALL VAR VAR IF VAR VAR STRING VAR VAR STRING VAR VAR STRING VAR NUMBER IF VAR NUMBER RETURN NUMBER ASSIGN VAR VAR STRING IF VAR VAR STRING VAR VAR STRING VAR VAR STRING VAR NUMBER IF VAR NUMBER RETURN NUMBER ASSIGN VAR VAR STRING IF VAR VAR STRING VAR VAR STRING VAR VAR... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
while q > 0:
k = int(input())
a = input()
b = input()
c = input()
h_size = max(len(a) * 4, max(len(b) * 4, len(c) * 4))
bin_a = bin(int(a, 16))[2:].zfill(h_size)
bin_b = bin(int(b, 16))[2:].zfill(h_size)
bin_c = bin(int(c, 16))[2:].zfill(h_size)
ans_a = list(bin_a)
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR WHILE VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
for qq in range(q):
k = int(input())
a = list(bin(int(input(), 16))[2:].zfill(16**5))
b = list(bin(int(input(), 16))[2:].zfill(16**5))
c = list(bin(int(input(), 16))[2:].zfill(16**5))
notPossible = False
for i in range(len(a)):
if a[i] == "1" and c[i] == "0":
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER BIN_OP NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER BIN_OP NUMBER... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def string_to_bits(s, total_bits):
for _ in range(total_bits - 4 * len(s)):
yield 0
for c in s:
bits = []
number = int(c, base=16)
for _ in range(4):
bits.append(number % 2)
number //= 2
for bit in reversed(bits):
yield bit
def group(... | FUNC_DEF FOR VAR FUNC_CALL VAR BIN_OP VAR BIN_OP NUMBER FUNC_CALL VAR VAR EXPR NUMBER FOR VAR VAR ASSIGN VAR LIST ASSIGN VAR FUNC_CALL VAR VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR NUMBER VAR NUMBER FOR VAR FUNC_CALL VAR VAR EXPR VAR FUNC_DEF ASSIGN VAR LIST FOR VAR VAR EXPR FUNC_CALL VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | BITS = {
"0": [0, 0, 0, 0],
"1": [1, 0, 0, 0],
"2": [0, 1, 0, 0],
"3": [1, 1, 0, 0],
"4": [0, 0, 1, 0],
"5": [1, 0, 1, 0],
"6": [0, 1, 1, 0],
"7": [1, 1, 1, 0],
"8": [0, 0, 0, 1],
"9": [1, 0, 0, 1],
"A": [0, 1, 0, 1],
"B": [1, 1, 0, 1],
"C": [0, 0, 1, 1],
"D": [1,... | ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING LIST NUMBER NUMBER NUMBER NUMBER LIST NUMBER NUMBER NUMBER NUMBER LIST NUMBER NUMBER NUMBER NUMBER LIST NUMBER NUMBER NUMBER NUMBER LIST NUMBER NUMBER NUMBER NUMBER LIST NUMBER NUMBER NUMBER N... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | dtoh = {
(0): "0",
(1): "1",
(2): "2",
(3): "3",
(4): "4",
(5): "5",
(6): "6",
(7): "7",
(8): "8",
(9): "9",
(10): "A",
(11): "B",
(12): "C",
(13): "D",
(14): "E",
(15): "F",
}
T = int(input())
for t in range(T):
K = int(input())
A = list(input())
... | ASSIGN VAR DICT NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input().strip())
def bump_len(s, l):
return "0" * (l - len(s)) + s
count = [0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4]
def bits_for_digit(a, b, c):
ab = a | b
drop_a = a & ~c
drop_b = b & ~c
needed = ~ab & c
return count[needed] + count[drop_a] + count[drop_b]
def doit(a, b,... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN BIN_OP BIN_OP STRING BIN_OP VAR FUNC_CALL VAR VAR VAR ASSIGN VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_DEF ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR B... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input().strip())
for i in range(Q):
K = int(input().strip())
K_orig = K
A_temp = input().strip()
B_temp = input().strip()
C_temp = input().strip()
z = len(C_temp) * 4
A = bin(int(A_temp, 16))[2:].zfill(z)
B = bin(int(B_temp, 16))[2:].zfill(z)
C = bin(int(C_temp, 16))[2:].zfil... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL FUNC_CALL VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
class Enum:
skip = 0
flip_a = 1
flip_b = 2
flip_both = 3
potential_flip_both = 4
potential_flip_a = 5
def binaryToHex(x):
return hex(int(x, 2))[2:].upper()
def hexToBinary(x, numBits):
scale = 16
return bin(int(x, scale))[2:].zfill(numBits)
def getAction(a, b... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR CLASS_DEF ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR NUMBER RETURN FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR VAR NUMBER VAR ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def hex_to_bin(st):
res = ""
for i in st:
if i == "0":
res += "0000"
elif i == "1":
res += "0001"
elif i == "2":
res += "0010"
elif i == "3":
res += "0011"
elif i == "4":
res += "0100"
elif i == "5":
... | FUNC_DEF ASSIGN VAR STRING FOR VAR VAR IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR STRING VAR STRING IF VAR... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def c2i(c):
n = ord(c) - 48
return (n, n - 7)[n > 9]
def i2c(n):
code = (n + 55, n + 48)[n < 10]
return chr(code)
def getbit(s, ibyte, ibit):
return ibyte < len(s) and s[ibyte] & ibit or 0
Q = int(input())
for _ in range(Q):
K = int(input())
sa = input()
sb = input()
sc = input... | FUNC_DEF ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER RETURN VAR BIN_OP VAR NUMBER VAR NUMBER FUNC_DEF ASSIGN VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR NUMBER RETURN FUNC_CALL VAR VAR FUNC_DEF RETURN VAR FUNC_CALL VAR VAR BIN_OP VAR VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def oor(a, b):
if str(a) == "1" or str(b) == "1":
return 1
else:
return 0
for _ in range(int(input())):
k = int(input())
a = str(bin(int(input(), 16)))[2:]
b = str(bin(int(input(), 16)))[2:]
c = str(bin(int(input(), 16)))[2:]
le = max([len(i) for i in [a, b, c]])
a = li... | FUNC_DEF IF FUNC_CALL VAR VAR STRING FUNC_CALL VAR VAR STRING RETURN NUMBER RETURN NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | bits = [
"0000",
"0001",
"0010",
"0011",
"0100",
"0101",
"0110",
"0111",
"1000",
"1001",
"1010",
"1011",
"1100",
"1101",
"1110",
"1111",
]
def hex2bits(h):
s = ""
for d in h:
if d.isnumeric():
s += bits[int(d)]
else:
... | ASSIGN VAR LIST STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING FUNC_DEF ASSIGN VAR STRING FOR VAR VAR IF FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR VAR NUMBER RETURN VAR FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR FUNC_... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
d = {
"0": "0000",
"1": "0001",
"2": "0010",
"3": "0011",
"4": "0100",
"5": "0101",
"6": "0110",
"7": "0111",
"8": "1000",
"9": "1001",
"A": "1010",
"B": "1011",
"C": "1100",
"D": "1101",
"E": "1110",
"F": "1111",
}
d2 = {
"0000": "0",... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING ASSIGN VAR DICT STRING STRING STRING STRI... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input())
for _ in range(0, Q):
num_swaps = int(input())
a = int(input(), 16)
b = int(input(), 16)
c = int(input(), 16)
a = [int(d) for d in bin(a)[2:]]
b = [int(d) for d in bin(b)[2:]]
c = [int(d) for d in bin(c)[2:]]
ideal_length = max(map(len, (a, b, c)))
a = [0] * (ideal_l... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FU... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | SOLUTION_PER_BIT = [
[[[True, 0, [0, 0]], [True, 1, [0, 1]]], [[True, 1, [0, 0]], [True, 0, [0, 1]]]],
[
[[True, 1, [0, 0]], [False, 2, [0, 1], [1, 0]]],
[[True, 2, [0, 0]], [False, 1, [0, 1], [1, 1]]],
],
]
def solve(K, A, B, C):
tentative_sol = []
tentative_K = 0
mandatory_K ... | ASSIGN VAR LIST LIST LIST LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST LIST LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST NUMBER NUMBER LIST LIST NUMBER NUMBER LIST NUM... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
for _ in range(q):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
maxlen = max(map(len, (a, b, c)))
a = a.zfill(maxlen)
b = b.zfill(maxlen)
c = c.zfill(maxlen)
best_a = ""
best_b = ""
changes = 0
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def to_bits(S, bits):
A = [0] * bits
i = bits - 4 * len(S)
for c in S:
j = int(c, 16)
if j & 8:
A[i] = 1
if j & 4:
A[i + 1] = 1
if j & 2:
A[i + 2] = 1
if j & 1:
A[i + 3] = 1
i += 4
return A
def print_hex(A)... | FUNC_DEF ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR BIN_OP VAR BIN_OP NUMBER FUNC_CALL VAR VAR FOR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR NUMBER IF BIN_OP VAR NUMBER ASSIGN VAR VAR NUMBER IF BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER NUMBER IF BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER NUMBER IF BIN_OP VAR NUMB... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
def swap(x):
x1 = x & 1
x2 = (x & 2) >> 1
x3 = (x & 4) >> 2
x4 = (x & 8) >> 3
return x1 << 3 | x2 << 2 | x3 << 1 | x4
for _ in range(q):
k = int(input())
a = input()
b = input()
c = input()
max_len = max(len(a), len(b), len(c))
if len(a) < max_len:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR NUMBER NUMBER RETURN BIN_OP BIN_OP BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR FOR VAR FUNC_CALL VAR VAR AS... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | queries = int(input())
def convert_hex_to_bin(hexstring):
return bin(int(hexstring, 16))[2:]
def convert_bin_to_hex(binstring):
return hex(int(binstring, 2))[2:]
def solve(k, a, b, c):
edits = 0
a = list(a)
b = list(b)
c = list(c)
for i, (ab, bb, cb) in enumerate(zip(a, b, c)):
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR FOR VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | class Solution:
def __init__(self):
self.K = int(input())
self.A = int(input(), 16)
self.B = int(input(), 16)
self.C = int(input(), 16)
def calculate(self):
changes = bin((self.A | self.B) ^ self.C).count("1")
if changes > self.K:
print(-1)
... | CLASS_DEF FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL FUNC_CALL VAR BIN_OP BIN_OP VAR VAR VAR STRING IF VAR VAR EXPR FUNC_CALL VAR NUMBER RETURN ASS... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def hex_to_bin(hex_str):
hi = int(hex_str, 16)
return map(int, bin(hi)[2:].zfill(4))
def bin_to_hex(bin_):
bi = int("".join(map(str, bin_)), 2)
return hex(bi)[2:].upper()
def edit_distance(A, B, C):
edit_scheme = {
(0, 0, 0): 0,
(0, 0, 1): 1,
(0, 1, 0): 1,
(0, 1, ... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR NUMBER RETURN FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR VAR VAR NUMBER RETURN FUNC_CALL FUNC_CALL VAR VAR NUMBER FUNC_DEF ASSIGN VAR DICT NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBE... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
def debug(*msg):
print(*msg, file=sys.stderr)
for each_test in range(int(input())):
k = int(input())
a = list(input())
b = list(input())
c = list(input())
for i in range(len(c)):
ai = int(a[i], base=16)
bi = int(b[i], base=16)
ci = int(c[i], base=16)
... | IMPORT FUNC_DEF EXPR FUNC_CALL VAR VAR VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def hex_to_bin(hex_str):
return bin(int(hex_str, 16))[2:]
def hex_to_bool_array(hex_str):
bin_str = hex_to_bin(hex_str)
return [(c == "1") for c in bin_str]
def bool_array_to_hex(arr):
arr = "".join([("1" if b else "0") for b in arr])
return hex(int(arr, 2)).upper()[2:]
def pad_bool_arrays(arr... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR RETURN VAR STRING VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL STRING VAR STRING STRING VAR VAR RETURN FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR ASSIGN VAR L... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def bin_to_hex(bin):
return hex(int(bin, 2)).upper()[2:]
def determine_answer(k, bin_a, bin_b, bin_c):
for i in range(len(bin_a)):
if bin_a[i] == "0" and bin_b[i] == "0" and bin_c[i] == "1":
bin_b[i] = "1"
k -= 1
elif bin_a[i] == "0" and bin_b[i] == "1" and bin_c[i] == ... | FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF FOR VAR FUNC_CALL VAR FUNC_CALL VAR VAR IF VAR VAR STRING VAR VAR STRING VAR VAR STRING ASSIGN VAR VAR STRING VAR NUMBER IF VAR VAR STRING VAR VAR STRING VAR VAR STRING ASSIGN VAR VAR STRING VAR NUMBER IF VAR VAR STRING VAR VAR STRING VAR ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = input()
for i in range(int(q)):
k = int(input())
A = ""
for e in input():
A += bin(int(e, 16))[2:].zfill(4)
B = ""
for e in input():
B += bin(int(e, 16))[2:].zfill(4)
C = ""
for e in input():
C += bin(int(e, 16))[2:].zfill(4)
biggest = max(len(A), len(B), len(... | ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR STRING FOR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER NUMBER ASSIGN VAR STRING FOR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER NUMBER NUMBER AS... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | maxm = 10**9
def distance(x, y, z, K):
count = 0
x, y, z = list(x), list(y), list(z)
for i in range(len(x)):
a, b, c = x[i], y[i], z[i]
if c == "1":
if a == "0" and b == "0":
count, y[i] = count + 1, "1"
elif c == "0":
if a == "1":
... | ASSIGN VAR BIN_OP NUMBER NUMBER FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR VAR VAR VAR VAR VAR IF VAR STRING IF VAR STRING VAR STRING ASSIGN VAR VAR VAR BIN_OP VAR NUMBER STRING IF VAR STRING IF VAR S... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | Q = int(input().strip())
for q in range(Q):
K = int(input().strip())
A = int(input().strip(), base=16)
B = int(input().strip(), base=16)
C = int(input().strip(), base=16)
bina = [int(s) for s in bin(A).split("b")[1]]
binb = [int(s) for s in bin(B).split("b")[1]]
binc = [int(s) for s in bin(C... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | testCases = int(input())
for i in range(testCases):
maxChange = int(input())
hexA = input()
hexB = input()
hexC = input()
binA = ""
binB = ""
binC = ""
binaryLength = len(hexA) * 4
binA = "{0:0{width}b}".format(int(hexA, 16), width=binaryLength)
binA = list(binA)
binB = "{0:0... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR STRING ASSIGN VAR STRING ASSIGN VAR STRING ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input().strip())
for qq in range(q):
k = int(input().strip())
a = input().strip()
b = input().strip()
c = input().strip()
max_len = max(len(a), max(len(b), len(c)))
a_bin = ""
b_bin = ""
c_bin = ""
for ch in a:
a_bin += bin(int(ch, 16))[2:].zfill(4)
for ch in b:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR VA... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def reduceab(k, a, b, c):
bitca = bitc(a)
reserved = 0
while bitca > 0 and k > 0:
mod = 1 << a.bit_length() - 1
a ^= mod
k -= 1
bitca -= 1
if mod & b == 0:
if k > 0:
b |= mod
k -= 1
else:
reserved... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER WHILE VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP NUMBER BIN_OP FUNC_CALL VAR NUMBER VAR VAR VAR NUMBER VAR NUMBER IF BIN_OP VAR VAR NUMBER IF VAR NUMBER VAR VAR VAR NUMBER VAR VAR VAR NUMBER VAR VAR RETURN VAR VAR FUNC_DEF ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP ... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def HEX(A):
A = "".join(list(map(str, A)))
A = int(A, 2)
A = hex(A).replace("0x", "")
return A
q = int(input())
for qq in range(q):
k = int(input())
a = int(input(), 16)
b = int(input(), 16)
c = int(input(), 16)
A = list(bin(a).replace("0b", ""))
B = list(bin(b).replace("0b", "... | FUNC_DEF ASSIGN VAR FUNC_CALL STRING FUNC_CALL VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL FUNC_CALL VAR VAR STRING STRING RETURN VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR NUMB... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input().strip())
for q0 in range(q):
k = int(input().strip())
a = int(input().strip(), 16)
b = int(input().strip(), 16)
c = int(input().strip(), 16)
a1 = c & a
b1 = c & b | c & ~a
diff = bin(a1 ^ a).count("1") + bin(b1 ^ b).count("1")
if diff > k:
print(-1)
else:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP VAR VAR AS... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | bn = {
"0": "0000",
"1": "0001",
"2": "0010",
"3": "0011",
"4": "0100",
"5": "0101",
"6": "0110",
"7": "0111",
"8": "1000",
"9": "1001",
"A": "1010",
"B": "1011",
"C": "1100",
"D": "1101",
"E": "1110",
"F": "1111",
}
hx = {
"0000": "0",
"0001": "1"... | ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING S... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | def calculate(A, B, C, k):
n = max(len(A), len(B), len(C))
A, B, C = ([0] * (n - len(x)) + x for x in (A, B, C))
for i, a, b, c in zip(range(n), A, B, C):
if a | b < c:
B[i] = 1
k -= 1
elif a | b > c:
k -= a + b
A[i] = B[i] = 0
if k < 0... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR BIN_OP BIN_OP LIST NUMBER BIN_OP VAR FUNC_CALL VAR VAR VAR VAR VAR VAR VAR FOR VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR VAR IF BIN_OP VAR VAR VAR ASSIGN VAR VAR NUMBER VAR NUMBER IF BIN_OP VAR VAR V... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | import sys
def parse_input(n):
return list("{0:0b}".format(int(n, 16)))
def lpad(x, size):
return ["0"] * (size - len(x)) + x
def normalize(A, B, C):
size = max(len(A), len(B), len(C))
return lpad(A, size), lpad(B, size), lpad(C, size)
def solve(A, B, C, K):
changes = 0
index = 0
whi... | IMPORT FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL STRING FUNC_CALL VAR VAR NUMBER FUNC_DEF RETURN BIN_OP BIN_OP LIST STRING BIN_OP VAR FUNC_CALL VAR VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR RETURN FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_... |
Consider four numbers: $\mbox{A}$, $\mbox{B}$, $\mbox{C}$, and $\mbox{K}$. You must change at most $\mbox{K}$ bits in $\mbox{A}$ and $\mbox{B}$ to form the numbers $\mbox{A'}$ and $B^{\prime}$ satisfying the equation $A'\mid B'=C$. Here, the | symbol denotes the bitwise OR operation.
Given $Q$ sets of the numbers defi... | q = int(input())
for repetition in range(q):
k = int(input())
a = bin(int(input(), 16))[2:]
b = bin(int(input(), 16))[2:]
c = bin(int(input(), 16))[2:]
l = max(map(len, (a, b, c)))
a = list("0" * (l - len(a)) + a)
b = list("0" * (l - len(b)) + b)
c = list("0" * (l - len(c)) + c)
i = ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR FUNC... |
You have received data from a Bubble bot. You know your task is to make factory facilities, but before you even start, you need to know how big the factory is and how many rooms it has. When you look at the data you see that you have the dimensions of the construction, which is in rectangle shape: N x M.
Then in the ... | def main():
n, m = map(int, input().split())
grid = [list(map(int, input().split())) for _ in range(n)]
visited = [([False] * m) for _ in range(n)]
rooms = []
for i in range(n):
for j in range(m):
if visited[i][j]:
continue
room_size = 0
st... | FUNC_DEF ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP LIST NUMBER VAR VAR FUNC_CALL VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR IF VAR VAR VAR ASSIGN VAR NUMBER ASSIGN V... |
You have received data from a Bubble bot. You know your task is to make factory facilities, but before you even start, you need to know how big the factory is and how many rooms it has. When you look at the data you see that you have the dimensions of the construction, which is in rectangle shape: N x M.
Then in the ... | def dfs(i, j):
vis[i][j] = True
global cells
cells += 1
adj = [(i - 1, j), (i, j + 1), (i + 1, j), (i, j - 1)]
adj.reverse()
c = box[i][j]
for x, y in adj:
if 0 <= x < n and 0 <= y < m and not vis[x][y] and not c % 2:
dfs(x, y)
c //= 2
n, m = (int(x) for x in in... | FUNC_DEF ASSIGN VAR VAR VAR NUMBER VAR NUMBER ASSIGN VAR LIST BIN_OP VAR NUMBER VAR VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR FOR VAR VAR VAR IF NUMBER VAR VAR NUMBER VAR VAR VAR VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR VAR VAR VAR NUMBER ASSIGN VAR ... |
You have received data from a Bubble bot. You know your task is to make factory facilities, but before you even start, you need to know how big the factory is and how many rooms it has. When you look at the data you see that you have the dimensions of the construction, which is in rectangle shape: N x M.
Then in the ... | directions = [(-1, 0), (0, 1), (1, 0), (0, -1)]
i_cant_do_bitwise_operations = {
(0): (False, False, False, False),
(1): (False, False, False, True),
(2): (False, False, True, False),
(3): (False, False, True, True),
(4): (False, True, False, False),
(5): (False, True, False, True),
(6): (Fa... | ASSIGN VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER ASSIGN VAR DICT NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER N... |
You have received data from a Bubble bot. You know your task is to make factory facilities, but before you even start, you need to know how big the factory is and how many rooms it has. When you look at the data you see that you have the dimensions of the construction, which is in rectangle shape: N x M.
Then in the ... | import sys
fast = sys.stdin.readline
n, m = map(int, fast().split())
grid = []
for _ in range(n):
grid.append(list(map(int, fast().split())))
def dfs(i, j):
if i >= 0 and j >= 0 and i < n and j < m and grid[i][j] != -1:
t = grid[i][j]
grid[i][j] = -1
ans = 0
for v in [[1, [0, ... | IMPORT ASSIGN VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR NUMBER VAR NUMBER VAR VAR VAR VAR VAR VAR VAR NUMBER ASSIGN VAR VAR VAR VAR ASSIGN VAR VAR VAR NUMBER ASSIGN... |
You have received data from a Bubble bot. You know your task is to make factory facilities, but before you even start, you need to know how big the factory is and how many rooms it has. When you look at the data you see that you have the dimensions of the construction, which is in rectangle shape: N x M.
Then in the ... | import sys
sys.setrecursionlimit(100000)
def _r():
return sys.stdin.buffer.readline()
def rs():
return _r().decode("ascii").strip()
def rn():
return int(_r())
def rnt():
return map(int, _r().split())
def rnl():
return list(rnt())
def solve(n, m, mat):
dp, color = [([0] * m) for _ in... | IMPORT EXPR FUNC_CALL VAR NUMBER FUNC_DEF RETURN FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL FUNC_CALL FUNC_CALL VAR STRING FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR VAR BIN_OP LIST NUMBER VAR VAR FUN... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.