description stringlengths 171 4k | code stringlengths 94 3.98k | normalized_code stringlengths 57 4.99k |
|---|---|---|
Vasya will fancy any number as long as it is an integer power of two. Petya, on the other hand, is very conservative and only likes a single integer $p$ (which may be positive, negative, or zero). To combine their tastes, they invented $p$-binary numbers of the form $2^x + p$, where $x$ is a non-negative integer.
For ... | n, p = map(int, input().split())
min_ans = -1
for i in range(1, 10000):
nn = n
nn -= i * p
if nn > 0:
st = bin(nn)[2:]
if st.count("1") <= i and nn >= i:
min_ans = i
break
print(min_ans) | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR VAR VAR BIN_OP VAR VAR IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER IF FUNC_CALL VAR STRING VAR VAR VAR ASSIGN VAR VAR EXPR FUNC_CALL VAR VAR |
Vasya will fancy any number as long as it is an integer power of two. Petya, on the other hand, is very conservative and only likes a single integer $p$ (which may be positive, negative, or zero). To combine their tastes, they invented $p$-binary numbers of the form $2^x + p$, where $x$ is a non-negative integer.
For ... | n, p = map(int, input().split())
if n == 0:
print(0)
elif p >= n:
print(-1)
else:
i = 0
while 1:
n -= p
if n <= 0:
print(-1)
break
i += 1
s = str(bin(n))
k = 0
for j in s:
if j == "1":
k += 1
if k... | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR IF VAR NUMBER EXPR FUNC_CALL VAR NUMBER IF VAR VAR EXPR FUNC_CALL VAR NUMBER ASSIGN VAR NUMBER WHILE NUMBER VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR NUMBER VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR VAR IF VAR STRING VAR NUMBE... |
Vasya will fancy any number as long as it is an integer power of two. Petya, on the other hand, is very conservative and only likes a single integer $p$ (which may be positive, negative, or zero). To combine their tastes, they invented $p$-binary numbers of the form $2^x + p$, where $x$ is a non-negative integer.
For ... | n, p = map(int, input().split())
ans = -1
for i in range(40):
t = n - p * i
if t < 0:
break
cnt = 0
while t:
if t & 1:
cnt += 1
t >>= 1
if n - p * i >= i and cnt <= i:
print(i)
exit()
print(ans) | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP VAR VAR IF VAR NUMBER ASSIGN VAR NUMBER WHILE VAR IF BIN_OP VAR NUMBER VAR NUMBER VAR NUMBER IF BIN_OP VAR BIN_OP VAR VAR VAR VAR VAR EXPR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR EXPR FUNC_C... |
Vasya will fancy any number as long as it is an integer power of two. Petya, on the other hand, is very conservative and only likes a single integer $p$ (which may be positive, negative, or zero). To combine their tastes, they invented $p$-binary numbers of the form $2^x + p$, where $x$ is a non-negative integer.
For ... | n, m = map(int, input().split())
i = 1
count = 0
flag = 0
while True:
count = 0
if n - m * i <= 0:
flag = 1
break
str = bin(n - m * i).replace("0b", "")
for j in str:
if j == "1":
count += 1
if i >= count and i <= n - m * i:
break
i += 1
if flag == 1:
... | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER WHILE NUMBER ASSIGN VAR NUMBER IF BIN_OP VAR BIN_OP VAR VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL FUNC_CALL VAR BIN_OP VAR BIN_OP VAR VAR STRING STRING FOR VAR VAR IF VAR STRING VAR NUMBER IF VAR VAR V... |
Have you ever played Hanabi? If not, then you've got to try it out! This problem deals with a simplified version of the game.
Overall, the game has 25 types of cards (5 distinct colors and 5 distinct values). Borya is holding n cards. The game is somewhat complicated by the fact that everybody sees Borya's cards excep... | A = {"R": 0, "G": 1, "B": 2, "Y": 3, "W": 4}
def bit_m(s):
num = 1 << int(s[1]) - 1
symb = 1 << A[s[0]] + 5
return num | symb
n = int(input())
cards = list(set(input().split()))
res = [(0) for i in range(len(cards))]
mask = [bit_m(cards[i]) for i in range(len(cards))]
def make_res(Q, cards):
for i... | ASSIGN VAR DICT STRING STRING STRING STRING STRING NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_DEF ASSIGN VAR BIN_OP NUMBER BIN_OP FUNC_CALL VAR VAR NUMBER NUMBER ASSIGN VAR BIN_OP NUMBER BIN_OP VAR VAR NUMBER NUMBER RETURN BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CA... |
Have you ever played Hanabi? If not, then you've got to try it out! This problem deals with a simplified version of the game.
Overall, the game has 25 types of cards (5 distinct colors and 5 distinct values). Borya is holding n cards. The game is somewhat complicated by the fact that everybody sees Borya's cards excep... | def main():
p = [1]
for i in range(1, 11):
p.append(p[i - 1] * 2)
hr = "12345RGBYW"
gt = {
"1": 0,
"2": 1,
"3": 2,
"4": 3,
"5": 4,
"R": 5,
"G": 6,
"B": 7,
"Y": 8,
"W": 9,
}
def check(c, mask):
tmp = ... | FUNC_DEF ASSIGN VAR LIST NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER EXPR FUNC_CALL VAR BIN_OP VAR BIN_OP VAR NUMBER NUMBER ASSIGN VAR STRING ASSIGN VAR DICT STRING STRING STRING STRING STRING STRING STRING STRING STRING STRING NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER NUMBER FUNC_DEF ASSIGN VAR VAR... |
Have you ever played Hanabi? If not, then you've got to try it out! This problem deals with a simplified version of the game.
Overall, the game has 25 types of cards (5 distinct colors and 5 distinct values). Borya is holding n cards. The game is somewhat complicated by the fact that everybody sees Borya's cards excep... | input()
p = {((1 << "RGBYW".index(c)) + (1 << int(k) + 4)) for c, k in input().split()}
print(
min(bin(t).count("1") for t in range(1024) if len({(t & q) for q in p}) == len(p))
) | EXPR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP NUMBER FUNC_CALL STRING VAR BIN_OP NUMBER BIN_OP FUNC_CALL VAR VAR NUMBER VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR VAR STRING VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR BIN_OP VAR VAR VAR VAR FUNC_CALL VAR VAR |
Have you ever played Hanabi? If not, then you've got to try it out! This problem deals with a simplified version of the game.
Overall, the game has 25 types of cards (5 distinct colors and 5 distinct values). Borya is holding n cards. The game is somewhat complicated by the fact that everybody sees Borya's cards excep... | n = int(input())
data = set(input().split())
temp = "RGBYW"
c = []
res = 10
for i in data:
p1 = temp.find(i[0])
p2 = int(i[1]) - 1
c.append(2**p1 + 2 ** (p2 + 5))
for i in range(1024):
ok = True
for j in range(len(c) - 1):
for k in range(j + 1, len(c)):
if c[j] & i == c[k] & i:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR STRING ASSIGN VAR LIST ASSIGN VAR NUMBER FOR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP FUNC_CALL VAR VAR NUMBER NUMBER EXPR FUNC_CALL VAR BIN_OP BIN_OP NUMBER VAR BIN_OP NUMBER BIN_OP VAR NUMBER FOR VA... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | import sys
def get_sol(a, b, c, n, reverse):
if reverse[0]:
a = a[1], a[0], a[2]
if reverse[1]:
b = b[1], b[0], b[2]
if reverse[2]:
c = c[1], c[0], c[2]
ans = []
if a[0] == b[0] == c[0] == n:
if a[1] + b[1] + c[1] == n:
for i in range(a[1]):
... | IMPORT FUNC_DEF IF VAR NUMBER ASSIGN VAR VAR NUMBER VAR NUMBER VAR NUMBER IF VAR NUMBER ASSIGN VAR VAR NUMBER VAR NUMBER VAR NUMBER IF VAR NUMBER ASSIGN VAR VAR NUMBER VAR NUMBER VAR NUMBER ASSIGN VAR LIST IF VAR NUMBER VAR NUMBER VAR NUMBER VAR IF BIN_OP BIN_OP VAR NUMBER VAR NUMBER VAR NUMBER VAR FOR VAR FUNC_CALL VA... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | def print_if_possible(w, h):
xw, xh = max(w), max(h)
nw, nh = min(w), min(h)
x = max(xw, xh)
wm, hm = w.count(xw), h.count(xh)
if hm == 1 and xh == x:
q = h.index(xh)
i, j = (q + 1) % 3, (q + 2) % 3
if xh != sum(w) - w[i] or h[q] != h[i] + h[j] or w[i] != w[j]:
re... | FUNC_DEF ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR IF VAR NUMBER VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR VAR BIN_OP BIN_OP VAR NUMBER NUMBER BIN_OP BIN_OP VAR NUMBER NU... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | import itertools
x1, y1, x2, y2, x3, y3 = list(map(int, input().split(" ")[:6]))
A, B, C = (x1, y1, "A"), (x2, y2, "B"), (x3, y3, "C")
def rot(X, do_rot):
return (X[1], X[0], X[2]) if do_rot else X
def solve_1(A, B, C):
w = A[0] + B[0] + C[0]
if A[1] == B[1] == C[1] == w:
res = [["" for j in ra... | IMPORT ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING NUMBER ASSIGN VAR VAR VAR VAR VAR STRING VAR VAR STRING VAR VAR STRING FUNC_DEF RETURN VAR VAR NUMBER VAR NUMBER VAR NUMBER VAR FUNC_DEF ASSIGN VAR BIN_OP BIN_OP VAR NUMBER VAR NUMBER VAR NUMBER IF VAR NUMBER VAR NUMBER... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | a1, a2, b1, b2, c1, c2 = map(int, input().split())
l = max([a1, a2, b1, b2, c1, c2])
if a1 * a2 + b1 * b2 + c1 * c2 != l**2:
print(-1)
else:
if a1 > a2:
a1, a2 = a2, a1
if b1 > b2:
b1, b2 = b2, b1
if c1 > c2:
c1, c2 = c2, c1
if a2 == b2 and b2 == c2:
print(l)
... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR LIST VAR VAR VAR VAR VAR VAR IF BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR NUMBER IF VAR VAR ASSIGN VAR VAR VAR VAR IF VAR VAR ASSIGN VAR VAR VAR VAR IF VAR VAR ASSIGN V... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | def getprint(c1, c2, c3, maxi, ost, delta):
ans = str(maxi) + "\n" + (c1 * maxi + "\n") * ost
return ans + (c2 * delta + c3 * (maxi - delta) + "\n") * (maxi - ost)
def solve():
a = list(map(int, input().split()))
if max(a) ** 2 != a[0] * a[1] + a[2] * a[3] + a[4] * a[5]:
return -1
maxi = m... | FUNC_DEF ASSIGN VAR BIN_OP BIN_OP FUNC_CALL VAR VAR STRING BIN_OP BIN_OP BIN_OP VAR VAR STRING VAR RETURN BIN_OP VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR VAR STRING BIN_OP VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR IF BIN_OP FUNC_CALL VAR VAR NUMBER BIN_OP B... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | a, b, c, d, e, f = map(int, input().split())
n, n1 = 1, a * b + c * d + e * f
while n**2 < n1:
n += 1
if n**2 > n1:
print(-1)
exit()
l = sorted(
[
[max(a, b), min(a, b), "A"],
[max(c, d), min(c, d), "B"],
[max(e, f), min(e, f), "C"],
]
)
if l[2][0] != n:
print(-1)
exi... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR NUMBER BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR WHILE BIN_OP VAR NUMBER VAR VAR NUMBER IF BIN_OP VAR NUMBER VAR EXPR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR LIST LIST FUNC_CALL VAR VAR VAR ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | def out(t, x1, y1, x2, y2, x3, y3, m):
if t == 1:
print(x1)
for i in range(y1):
for j in range(x1):
print("A", end="")
print()
for i in range(y2):
for j in range(x1):
print("B", end="")
print()
for i in r... | FUNC_DEF IF VAR NUMBER EXPR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR STRING STRING EXPR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR STRING STRING EXPR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | __author__ = "User"
def f(arr, value, deep, vis):
global flag
if flag == True:
return
fl = False
pos = 0, 0
for i in range(n):
for j in range(n):
if arr[i][j] == 0:
pos = i, j
fl = True
break
if fl == True:
... | ASSIGN VAR STRING FUNC_DEF IF VAR NUMBER RETURN ASSIGN VAR NUMBER ASSIGN VAR NUMBER NUMBER FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR IF VAR VAR VAR NUMBER ASSIGN VAR VAR VAR ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR VAR NUMBER FOR VAR VAR VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR VAR NUMBER VAR NUMBER IF VAR ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | def main():
mode = "filee"
if mode == "file":
p = open("test.txt", "r")
get = lambda: [
int(x) for x in (p.readline() if mode == "file" else input()).split()
]
[a, b, c, d, e, f] = get()
g = [[a, b, "A"], [c, d, "B"], [e, f, "C"]]
n = 0
for i in g:
n = max(n, max(... | FUNC_DEF ASSIGN VAR STRING IF VAR STRING ASSIGN VAR FUNC_CALL VAR STRING STRING ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR STRING FUNC_CALL VAR FUNC_CALL VAR ASSIGN LIST VAR VAR VAR VAR VAR VAR FUNC_CALL VAR ASSIGN VAR LIST LIST VAR VAR STRING LIST VAR VAR STRING LIST VAR VAR STRING ASSIGN VAR NUMBER FOR VAR VAR AS... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | a, b, c, d, e, f = list(map(int, input().split()))
m = sorted(
[
(max(a, b), min(a, b), "A"),
(max(c, d), min(c, d), "B"),
(max(e, f), min(e, f), "C"),
]
)
ma = m[-1][0]
ma2 = ma - m[-1][1]
ans = [(["A"] * ma) for i in range(ma)]
if a * b + c * d + e * f != ma * ma:
print(-1)
elif m[... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR LIST FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR STRING FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR STRING FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR STRING ASSIGN VAR VAR NUMBER NUMBER ASSIGN VAR BIN_OP VAR... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | import itertools
a, b, c = [[(0) for _ in range(2)] for _ in range(3)]
a[0], a[1], b[0], b[1], c[0], c[1] = [int(i) for i in input().split()]
if max(a) == max(b) == max(c) == min(a) + min(b) + min(c):
print(max(a))
for _ in range(min(a)):
print("".join(["A" for __ in range(max(a))]))
for _ in range... | IMPORT ASSIGN VAR VAR VAR NUMBER VAR FUNC_CALL VAR NUMBER VAR FUNC_CALL VAR NUMBER ASSIGN VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR BIN_OP BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL V... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | x1, y1, x2, y2, x3, y3 = list(map(int, input().split()))
def solve(x1, y1, x2, y2, x3, y3):
n = max(x1, y1, x2, y2, x3, y3)
sum_area = x1 * y1 + x2 * y2 + x3 * y3
if sum_area != n * n:
return -1, None
if x1 < y1:
x1, y1 = y1, x1
if x2 < y2:
x2, y2 = y2, x2
if x3 < y3:
... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR VAR VAR VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR IF VAR BIN_OP VAR VAR RETURN NUMBER NONE IF VAR VAR ASSIGN VAR VAR VAR VAR IF VAR VAR ASSIGN VAR VAR VAR ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | from itertools import permutations
def stripe(a, b, c):
ans = [str(a[0])]
ans.append("\n".join(a[2] * a[0] for _ in range(a[1])))
ans.append("\n".join(b[2] * b[0] for _ in range(b[1])))
ans.append("\n".join(c[2] * c[0] for _ in range(c[1])))
return "\n".join(ans)
def tt(a):
return a[1], a[0]... | FUNC_DEF ASSIGN VAR LIST FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL STRING BIN_OP VAR NUMBER VAR NUMBER VAR FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL STRING BIN_OP VAR NUMBER VAR NUMBER VAR FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL STRING BIN_OP VAR NUMBER VAR NUMBER VAR FUNC_CALL VAR... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | x1, y1, x2, y2, x3, y3 = map(int, input().split())
x1, y1 = max(x1, y1), min(x1, y1)
x2, y2 = max(x2, y2), min(x2, y2)
x3, y3 = max(x3, y3), min(x3, y3)
x1c, y1c, x2c, y2c, x3c, y3c = x1, y1, x2, y2, x3, y3
if x2 == max(x1, x2, x3):
x1, y1, x2, y2 = x2, y2, x1, y1
elif x3 == max(x1, x2, x3):
x1, y1, x3, y3 = x3... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR IF VAR FUNC_CAL... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | __author__ = "Admin"
def f(n):
return max(n[0], n[1])
t = True
x1, y1, x2, y2, x3, y3 = map(int, input().split())
m = [x1, y1, x2, y2, x3, y3]
m1 = [[x1, y1, "A"], [x2, y2, "B"], [x3, y3, "C"]]
m1.sort(key=f)
maxi = max(m1[-1][0], m1[-1][1])
mini = min(m1[-1][0], m1[-1][1])
maxj = max(m1[-2][1], m1[-2][0])
minj... | ASSIGN VAR STRING FUNC_DEF RETURN FUNC_CALL VAR VAR NUMBER VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST VAR VAR VAR VAR VAR VAR ASSIGN VAR LIST LIST VAR VAR STRING LIST VAR VAR STRING LIST VAR VAR STRING EXPR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | a, b, c, d, e, f = map(int, input().split())
if a < b:
a, b = b, a
if c < d:
c, d = d, c
if e < f:
e, f = f, e
sides = [[a, b, "A"], [c, d, "B"], [e, f, "C"]]
sides.sort(reverse=True)
c1, c2, c3 = sides[0][2], sides[1][2], sides[2][2]
area = a * b + c * d + e * f
if int(area**0.5) ** 2 != area:
print(-1... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR IF VAR VAR ASSIGN VAR VAR VAR VAR IF VAR VAR ASSIGN VAR VAR VAR VAR IF VAR VAR ASSIGN VAR VAR VAR VAR ASSIGN VAR LIST LIST VAR VAR STRING LIST VAR VAR STRING LIST VAR VAR STRING EXPR FUNC_CALL VAR NUMBER ASSIGN VAR VAR VAR VAR NUMBER NUMBER VAR NU... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | import time
def flag(a, b, c, d, e, f, X, Y, Z):
if b == d and d == f and a + c + e == b:
m = [[(0) for i in range(b)] for i in range(b)]
for i in range(a):
for j in range(b):
m[i][j] = X
for i in range(a, a + c):
for j in range(b):
m... | IMPORT FUNC_DEF IF VAR VAR VAR VAR BIN_OP BIN_OP VAR VAR VAR VAR ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR FOR VAR FUNC_CALL VAR VAR BIN_OP VAR VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR FOR VAR FUNC_CALL VAR BIN_OP... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | from itertools import permutations
def isqrt(x):
l, r = 0, 10**100
while l < r - 1:
mid = (l + r) // 2
if mid**2 > x:
r = mid
else:
l = mid
return l
x1, y1, x2, y2, x3, y3 = map(int, input().split())
p = [(x1, y1, "A"), (x2, y2, "B"), (x3, y3, "C")]
s = x1... | FUNC_DEF ASSIGN VAR VAR NUMBER BIN_OP NUMBER NUMBER WHILE VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR NUMBER IF BIN_OP VAR NUMBER VAR ASSIGN VAR VAR ASSIGN VAR VAR RETURN VAR ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST VAR VAR STRING VAR VAR STRING VAR VAR STRING ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | def chnge(last, cap, ini=(0, 0)):
for i in range(ini[1], last[1]):
fin[i][ini[0] : last[0]] = [cap] * (last[0] - ini[0])
x1, y1, x2, y2, x3, y3 = map(int, input().split())
a = max(x1, y1), [x1, y1], "A"
b = max(x2, y2), [x2, y2], "B"
c = max(x3, y3), [x3, y3], "C"
m = max(a[0], b[0], c[0])
fin = [["*" for... | FUNC_DEF NUMBER NUMBER FOR VAR FUNC_CALL VAR VAR NUMBER VAR NUMBER ASSIGN VAR VAR VAR NUMBER VAR NUMBER BIN_OP LIST VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR LIST VAR VAR STRING ASSIGN VAR FUNC_CALL VAR VAR VAR LIST VAR VAR... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | x1, y1, x2, y2, x3, y3 = map(int, input().split())
rect1 = [x1, y1]
rect2 = [x2, y2]
rect3 = [x3, y3]
def func():
rect11 = [x1, y1]
rect22 = [x2, y2]
rect33 = [x3, y3]
rect1 = [x1, y1]
rect2 = [x2, y2]
rect3 = [x3, y3]
recta = [x1, y1]
rectb = [x2, y2]
rectc = [x3, y3]
for i in... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR FUNC_DEF ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VAR ASSIGN VAR LIST VAR VA... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | import sys
x1, y1, x2, y2, x3, y3 = map(int, input().split())
a = x1, y1
b = x2, y2
c = x3, y3
for i in range(2):
for j in range(2):
for k in range(2):
if a[i] == b[j] == c[k] and a[1 - i] + b[1 - j] + c[1 - k] == a[i]:
print(a[i])
print(("A" * a[i] + "\n") * a[1... | IMPORT ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR FOR VAR FUNC_CALL VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER IF VAR VAR VAR VAR VAR VAR BIN_OP BIN_OP VAR BIN_OP NUMBER VAR VAR BIN_OP NUMBER VAR VAR BIN_OP ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | from sys import *
inp = lambda: stdin.readline()
def main():
x1, y1, x2, y2, x3, y3 = map(int, inp().split())
m = max(x1, x2, x3, y1, y2, y3)
l = [(x1, y1), (x2, y2), (x3, y3)]
ans = [["C" for i in range(m)] for i in range(m)]
bools = True
if all([(m in x) for x in l]):
if min(x1, y1)... | ASSIGN VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR VAR VAR VAR VAR ASSIGN VAR LIST VAR VAR VAR VAR VAR VAR ASSIGN VAR STRING VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER IF FUNC_CALL VAR VAR VAR VAR VAR IF BIN_OP B... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | ii = lambda: int(input())
kk = lambda: map(int, input().split())
ll = lambda: list(kk())
a, b, c, d, e, f = kk()
al = [a, b, c, d, e, f]
s = sum(al)
area = a * b + c * d + e * f
side = int(area**0.5)
if side**2 != area or side not in al:
print(-1)
exit()
if al.count(side) == 3:
if s == 4 * side:
res... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR ASSIGN VAR LIST VAR VAR VAR VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR ASSIG... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | x1, y1, x2, y2, x3, y3 = [int(s) for s in input().split()]
def print_logos(top, bottom, h1, h2):
top_line = ""
if "a" in top:
top_line += (x1 if top["a"] else y1) * "A"
if "b" in top:
top_line += (x2 if top["b"] else y2) * "B"
if "c" in top:
top_line += (x3 if top["c"] else y3)... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR STRING IF STRING VAR VAR BIN_OP VAR STRING VAR VAR STRING IF STRING VAR VAR BIN_OP VAR STRING VAR VAR STRING IF STRING VAR VAR BIN_OP VAR STRING VAR VAR STRING EXPR FUNC_CALL VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | inp = input().split()
a = [int(inp[0]), int(inp[1])]
b = [int(inp[2]), int(inp[3])]
c = [int(inp[4]), int(inp[5])]
a.sort()
a.reverse()
a.append("A")
b.sort()
b.reverse()
b.append("B")
c.sort()
c.reverse()
c.append("C")
first = [a, b, c]
first.sort()
first.reverse()
second = [a, b, c]
second.sort()
second.reverse()
thi... | ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER ASSIGN VAR LIST FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER ASSIGN VAR LIST FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR EXPR FUNC_CALL VAR STRING EXPR FUNC_CALL VAR EXPR... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | v = list(map(int, input().split()))
def funk(a):
if a[0] == a[2] + a[4] and a[1] + a[3] == a[0] and a[3] == a[5]:
print(a[0])
for i in range(a[1]):
print("A" * a[0])
for i in range(a[3]):
print("B" * a[2] + "C" * a[4])
elif a[0] == a[2] == a[4] and a[1] + a[3] +... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR NUMBER BIN_OP VAR NUMBER VAR NUMBER BIN_OP VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER EXPR FUNC_CALL VAR VAR NUMBER FOR VAR FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR BIN_OP STRING VAR NUMBER FOR VAR FUNC_CALL VAR VAR NUMBER... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | import itertools
import sys
def can(h1, w1, h2, w2, h3, w3, c1, c2, c3, tot):
if tot % h1 == 0 and tot // h1 == h1:
if h1 == h2 == h3:
print(h1)
for r in range(h1):
temp = ""
for c in range(w1 + w2 + w3):
if c < w1:
... | IMPORT IMPORT FUNC_DEF IF BIN_OP VAR VAR NUMBER BIN_OP VAR VAR VAR IF VAR VAR VAR EXPR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR STRING FOR VAR FUNC_CALL VAR BIN_OP BIN_OP VAR VAR VAR IF VAR VAR VAR VAR IF VAR BIN_OP VAR VAR VAR VAR VAR VAR EXPR FUNC_CALL VAR VAR RETURN NUMBER IF BIN_OP VAR VAR VAR VAR VAR... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | w1, h1, w2, h2, w3, h3 = map(int, input().split())
r1, r2, r3 = sorted((w1, h1)), sorted((w2, h2)), sorted((w3, h3))
for i in range(3):
ra, ca = (r1, r2, r3)[i], "ABC"[i]
rb, cb = (r1, r2, r3)[(i + 1) % 3], "ABC"[(i + 1) % 3]
rc, cc = (r1, r2, r3)[(i + 2) % 3], "ABC"[(i + 2) % 3]
if ra[0] == ra[1]:
... | ASSIGN VAR VAR VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR VAR VAR VAR VAR VAR STRING VAR ASSIGN VAR VAR VAR VAR VAR BIN_OP BIN_OP VAR NUMBER NUMBER STRING BIN_OP BIN_OP VAR NUMBER ... |
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | def possible(arr):
a, b, c, d, e, f = arr
if a == c == e and b + d + f == a:
one = "A" * b + "B" * d + "C" * f
print(a)
for i in range(a):
print(one)
return True
if b == d == f and a + c + e == d:
print(b)
for i in range(a):
print("A" *... | FUNC_DEF ASSIGN VAR VAR VAR VAR VAR VAR VAR IF VAR VAR VAR BIN_OP BIN_OP VAR VAR VAR VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP STRING VAR BIN_OP STRING VAR BIN_OP STRING VAR EXPR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR VAR RETURN NUMBER IF VAR VAR VAR BIN_OP BIN_OP VAR VAR VAR VAR EXPR FUNC_CALL VAR VA... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | import sys
I = sys.stdin.readline
def rails(x):
z, ret = 1, set()
while x:
if x & 1:
ret.add(z)
z += 1
x //= 2
return ret
n = int(I())
a = map(int, I().split())
a = [i for i in a if i > 0]
n = len(a)
b, e = [[] for i in range(n)], {}
for i, x in enumerate(a):
rs ... | IMPORT ASSIGN VAR VAR FUNC_DEF ASSIGN VAR VAR NUMBER FUNC_CALL VAR WHILE VAR IF BIN_OP VAR NUMBER EXPR FUNC_CALL VAR VAR VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR ... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | def do():
n = int(input())
nums = [int(c) for c in input().split(" ")]
valid = set()
for i in range(64):
count = []
for j in range(n):
if 1 << i & nums[j]:
count.append(nums[j])
if len(count) == 3:
return 3
if len(count) == ... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR IF BIN_OP BIN_OP NUMBER VAR VAR VAR EXPR FUNC_CALL VAR VAR VAR IF FUNC_CALL VAR VAR NUMBER RETURN NUMBER IF FUNC... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | import sys
n = int(input())
dat = [int(i) for i in input().split()]
data = [i for i in dat if i != 0]
n = len(data)
dic = {}
for d in data:
if d in dic:
dic[d] += 1
else:
dic[d] = 1
keys = list(dic.keys())
if len(keys) != len(data):
if len(data) > 200:
print(3)
sys.exit()
... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR DICT FOR VAR VAR IF VAR VAR VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR ... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | _ = int(input())
v = list(filter(lambda x: x > 0, list(map(int, input().split()))))
n = len(v)
if n > 128:
print(3)
exit(0)
ans = 10000000000.0
dis = [[(10000000000.0) for _ in range(n)] for __ in range(n)]
dp = [[(10000000000.0) for _ in range(n)] for __ in range(n)]
for i in range(n):
for j in range(n):
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR ... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | def solve(n, a):
B = 60
bits = [[] for i in range(B)]
for i in range(n):
for j in range(B):
if a[i] & 1 << j:
bits[j].append(i)
adj = [[] for i in range(n)]
for shared in bits:
if len(shared) >= 3:
return 3
elif len(shared) == 2:
... | FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR LIST VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR VAR IF BIN_OP VAR VAR BIN_OP NUMBER VAR EXPR FUNC_CALL VAR VAR VAR ASSIGN VAR LIST VAR FUNC_CALL VAR VAR FOR VAR VAR IF FUNC_CALL VAR VAR NUMBER RETURN NUMBER IF FUNC_CALL VAR VAR NUMBER ASSIGN VAR VAR VAR E... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | class node:
def __init__(self, v, edges):
self.value = v
self.edges = edges
n = int(input())
a = [int(i) for i in input().split(" ")]
def fun(a):
nodes = {}
for i in range(60):
k = 0
value = 1 << i
i_edges = set()
for j in a:
if value & j > 0:... | CLASS_DEF FUNC_DEF ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING FUNC_DEF ASSIGN VAR DICT FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR BIN_OP NUMBER VAR ASSIGN VAR FUNC_CALL VAR FOR VAR VAR IF BIN_OP VAR VAR NUMBER VAR N... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | def bfs(g, src, dest):
visited = {}
dist = {}
for i in g:
visited[i] = False
dist[i] = 1e18
dist[src] = 0
visited[src] = True
q = []
q.append(src)
while q:
src = q.pop(0)
for i in g[src]:
if visited[i] == False:
visited[i] = Tru... | FUNC_DEF ASSIGN VAR DICT ASSIGN VAR DICT FOR VAR VAR ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR LIST EXPR FUNC_CALL VAR VAR WHILE VAR ASSIGN VAR FUNC_CALL VAR NUMBER FOR VAR VAR VAR IF VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR VAR FUNC_CALL VAR VAR VAR BIN_O... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
L = max(A).bit_length()
ans = -1
graph = [[] for _ in range(N)]
V = []
for l in range(L):
P = []
for i in range(N):
if 1 << l & A[i]:
P.append(i)
if len(P) > 2:
ans = 3
break
e... | IMPORT ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR VAR ASSIGN VAR NUMBER ASSIGN VAR LIST VAR FUNC_CALL VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR IF BIN_OP BIN... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | import sys
n = int(input())
a = []
for x in input().split():
if int(x) != int(0):
a.append(int(x))
if len(a) > 500:
print(3)
return
n = len(a)
g = []
for i in range(n):
g.append([])
for i in range(n):
for j in range(n):
g[i].append(1000000000)
for i in range(n):
for j in range(n... | IMPORT ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL FUNC_CALL VAR IF FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL VAR VAR IF FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR NUMBER RETURN ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL ... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
s = [list() for i in range(0, 61)]
v = []
for _v in a:
if _v:
v.append(_v)
a = v
n = len(v)
if n > 128:
print(3)
exit()
for i in range(0, len(a)):
for j in range(0, 61):
if a[i] & 1 << j != 0:
... | IMPORT ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR LIST FOR VAR VAR IF VAR EXPR FUNC_CALL VAR VAR ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR ... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | def int2bin(n):
bit_cnt = ""
while n:
bit_cnt = str(n & 1) + bit_cnt
n >>= 1
return bit_cnt.zfill(70)
n = int(input())
if n <= 2:
print(-1)
exit(0)
A = list(map(int, input().split()))
B = []
for i in A:
B.append(int2bin(i))
graph = {i: set() for i in range(n + 55)}
starts = set... | FUNC_DEF ASSIGN VAR STRING WHILE VAR ASSIGN VAR BIN_OP FUNC_CALL VAR BIN_OP VAR NUMBER VAR VAR NUMBER RETURN FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR IF VAR NUMBER EXPR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FO... |
You are given $n$ integer numbers $a_1, a_2, \dots, a_n$. Consider graph on $n$ nodes, in which nodes $i$, $j$ ($i\neq j$) are connected if and only if, $a_i$ AND $a_j\neq 0$, where AND denotes the bitwise AND operation.
Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at al... | from sys import setrecursionlimit as SRL
from sys import stdin
SRL(10**7)
rd = stdin.readline
rrd = lambda: map(int, rd().strip().split())
n = int(rd())
a = list(rrd())
b = []
for i in a:
if i:
b.append(i)
a = b[:]
n = len(a)
cnt = [0] * 100
edge = [[] for _i in range(n + 100)]
con = [[] for _j in range(10... | EXPR FUNC_CALL VAR BIN_OP NUMBER NUMBER ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR LIST FOR VAR VAR IF VAR EXPR FUNC_CALL VAR VAR ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP LIST... |
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will consist of m bits. Then he asks Peter to choose some m-bit number. After that, ... | def OP(i, j, op):
if op == "AND":
return i & j
if op == "OR":
return i | j
if op == "XOR":
return i ^ j
return 0
def totbit(i, test):
ans = 0
for j in range(0, len(ops)):
a = ops[j][0]
b = ops[j][1]
op = ops[j][2]
if a == "?":
... | FUNC_DEF IF VAR STRING RETURN BIN_OP VAR VAR IF VAR STRING RETURN BIN_OP VAR VAR IF VAR STRING RETURN BIN_OP VAR VAR RETURN NUMBER FUNC_DEF ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR VAR ASSIGN VAR VAR VAR NUMBER ASSIGN VAR VAR VAR NUMBER ASSIGN VAR VAR VAR NUMBER IF VAR STRING ASSIGN VAR VAR IF VAR V... |
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will consist of m bits. Then he asks Peter to choose some m-bit number. After that, ... | def sumBin(a, b, varMap):
lhs = varMap[a]
rhs = varMap[b]
return bin(int(lhs, 2) + int(rhs, 2))[2:]
def andBin(a, b, varMap):
lhs = varMap[a]
rhs = varMap[b]
return bin(int(lhs, 2) & int(rhs, 2))[2:]
def orBin(a, b, varMap):
lhs = varMap[a]
rhs = varMap[b]
return bin(int(lhs, 2) ... | FUNC_DEF ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR RETURN FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR RETURN FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR VAR VAR ASSIGN VAR VAR VAR RETURN FU... |
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will consist of m bits. Then he asks Peter to choose some m-bit number. After that, ... | n, m = map(int, input().split())
vars = {}
def mxor(a, b):
if a == b:
return "0"
elif a == "0" and b == "1" or a == "1" and b == "0":
return "1"
elif a == "0" and b == "x" or a == "x" and b == "0":
return "x"
elif a == "0" and b == "!" or a == "!" and b == "0":
return "... | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR DICT FUNC_DEF IF VAR VAR RETURN STRING IF VAR STRING VAR STRING VAR STRING VAR STRING RETURN STRING IF VAR STRING VAR STRING VAR STRING VAR STRING RETURN STRING IF VAR STRING VAR STRING VAR STRING VAR STRING RETURN STRING IF VAR STRING VAR STRING VAR S... |
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will consist of m bits. Then he asks Peter to choose some m-bit number. After that, ... | f = {"OR": lambda x, y: x | y, "AND": lambda x, y: x & y, "XOR": lambda x, y: x ^ y}
n, m = map(int, input().split())
p, u, v = [], [], []
l = {"?": n}
for i in range(n):
q, s = input().split(" := ")
if " " in s:
x, t, y = s.split()
p += [(l[x], f[t], l[y])]
u += [i]
else:
p ... | ASSIGN VAR DICT STRING STRING STRING BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR LIST LIST LIST ASSIGN VAR DICT STRING VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR FUNC_CALL FUNC_CALL VAR STRING IF STRING VAR ASSIGN VAR VAR VAR FUNC_CALL VAR V... |
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will consist of m bits. Then he asks Peter to choose some m-bit number. After that, ... | n, m = map(int, input().split())
v = [("?", "")]
temp = [(0, 1)]
d = {}
d["?"] = 0
mn, mx = "", ""
for i in range(n):
name, val = input().split(" := ")
v.append((name, val.split()))
temp.append((-1, -1))
d[name] = i + 1
def eval(expr, bit1, bit2):
if expr == "OR":
return bit1 | bit2
el... | ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST STRING STRING ASSIGN VAR LIST NUMBER NUMBER ASSIGN VAR DICT ASSIGN VAR STRING NUMBER ASSIGN VAR VAR STRING STRING FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR FUNC_CALL FUNC_CALL VAR STRING EXPR FUNC_CALL VAR VAR FUNC_CALL VAR EXPR FUNC_CALL VAR NUMBE... |
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will consist of m bits. Then he asks Peter to choose some m-bit number. After that, ... | import sys
def calc(b0, b1, q):
if q == 0:
return b0 ^ b1
if q == 1:
return b0 | b1
if q == 2:
return b0 & b1
n, m = map(int, sys.stdin.readline().split())
arr1 = {}
opt = ["XOR", "OR", "AND"]
arr2 = []
for j in range(n):
a, b = list(map(str, sys.stdin.readline().split(" := "... | IMPORT FUNC_DEF IF VAR NUMBER RETURN BIN_OP VAR VAR IF VAR NUMBER RETURN BIN_OP VAR VAR IF VAR NUMBER RETURN BIN_OP VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR DICT ASSIGN VAR LIST STRING STRING STRING ASSIGN VAR LIST FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR FUNC_CALL VAR FUNC_CALL VAR V... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
l = 1e-06
def solve(c, m, p, v, k=1, prob=1.0):
s1 = 0
s2 = 0
if c > l:
prev_prob = c * prob
if c <= v:
n_c = 0.0
n_p = p + c
n_m = 0.0
if m > l:
n_m = m + c / 2
n_p = p + c / 2
s1 ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR NUMBER FUNC_DEF NUMBER NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP VAR VAR IF VAR VAR ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP VAR NUMBER ASS... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
input = sys.stdin.readline
scale = 40000
for _ in range(int(input())):
c, m, p, v = map(float, input().split())
c, m, p, v = c * scale, m * scale, p * scale, v * scale
def dfs(c, m, p):
ans = 1
if c:
x = min(v, c)
if not m:
ans += c / scal... | IMPORT ASSIGN VAR VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR FUNC_DEF ASSIGN VAR NUMBER IF VAR ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR VAR BIN_... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def rec(races, idx, choices, v):
if idx == 2:
return races
ch = choices.copy()
reduce = min(ch[idx], v)
ch[idx] -= reduce
cn, ci = 0, 0
for i in range(3):
if i != idx and ch[i] > 0:
cn += 1
ci = i
ch[i] += reduce / 2
if ch[i] < 1e-05:
... | FUNC_DEF IF VAR NUMBER RETURN VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR VAR VAR VAR VAR ASSIGN VAR VAR NUMBER NUMBER FOR VAR FUNC_CALL VAR NUMBER IF VAR VAR VAR VAR NUMBER VAR NUMBER ASSIGN VAR VAR VAR VAR BIN_OP VAR NUMBER IF VAR VAR NUMBER ASSIGN VAR VAR NUMBER IF VAR NUMBER RETURN VAR IF VAR NUMB... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | SCALE = 1000000.0
def find_odds(
c: float, m: float, p: float, v: float, cumulative: float = SCALE, depth=1
) -> float:
total = cumulative / SCALE * p / SCALE * depth
if c > 0:
new_c = max(0.0, c - v)
delta = c - new_c
if m > 0:
new_p = p + 0.5 * delta
new_m... | ASSIGN VAR NUMBER FUNC_DEF VAR VAR VAR VAR VAR VAR NUMBER ASSIGN VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR VAR VAR VAR VAR IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR NUMBER BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR IF VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP NUMBER VAR ASSIGN VAR BIN_OP VAR BIN_OP NUMBER VAR ASSIGN VAR BIN_OP VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
input = sys.stdin.readline
def calc(c, m, p, v):
ANS = p / 10**16
if c != 0:
M = min(c, v)
if m == 0:
ANS += c / 10**16 * (1 + calc(c - M, 0, p + M, v))
else:
ANS += c / 10**16 * (1 + calc(c - M, m + M // 2, p + M // 2, v))
if m != 0:
M =... | IMPORT ASSIGN VAR VAR FUNC_DEF ASSIGN VAR BIN_OP VAR BIN_OP NUMBER NUMBER IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR NUMBER VAR BIN_OP BIN_OP VAR BIN_OP NUMBER NUMBER BIN_OP NUMBER FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP VAR VAR VAR VAR BIN_OP BIN_OP VAR BIN_OP NUMBER NUMBER BIN_OP NUMBER FUNC_CALL VAR BI... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def main():
t = int(input())
for i in range(t):
c, m, p, v = list(map(float, input().split()))
res = 0
cur = [[c, m, p, 1]]
i = 0
while cur != []:
nxt = []
for node in cur:
c, m, p, q = node
if c != 0:
... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR LIST LIST VAR VAR VAR NUMBER ASSIGN VAR NUMBER WHILE VAR LIST ASSIGN VAR LIST FOR VAR VAR ASSIGN VAR VAR VAR VAR VAR IF VAR NUMBER IF VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def dfs(c, m, p, v, steps, prob):
ans = 0
if c != -1:
if m != -1:
if c <= v:
ans += dfs(-1, m + c / 2, p + c / 2, v, steps + 1, prob * c / r)
else:
ans += dfs(c - v, m + v / 2, p + v / 2, v, steps + 1, prob * c / r)
elif c <= v:
... | FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER IF VAR NUMBER IF VAR VAR VAR FUNC_CALL VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER BIN_OP BIN_OP VAR VAR VAR VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER BIN_OP BIN... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
sys.setrecursionlimit(15000)
epsilon = 1e-05
def game(c, m, p, chosen, length=0):
length += 1
if chosen == "p":
return p * length
if chosen == "m":
if m - v < epsilon:
if c > epsilon:
return m * game(c + m / 2, 0, p + m / 2, "c", length) + m * game(
... | IMPORT EXPR FUNC_CALL VAR NUMBER ASSIGN VAR NUMBER FUNC_DEF NUMBER VAR NUMBER IF VAR STRING RETURN BIN_OP VAR VAR IF VAR STRING IF BIN_OP VAR VAR VAR IF VAR VAR RETURN BIN_OP BIN_OP VAR FUNC_CALL VAR BIN_OP VAR BIN_OP VAR NUMBER NUMBER BIN_OP VAR BIN_OP VAR NUMBER STRING VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR BIN_OP V... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
from itertools import zip_longest
EPS = 1e-08
def read_floats():
return [float(i) for i in sys.stdin.readline().strip().split()]
def read_int():
return int(sys.stdin.readline().strip())
def probs(c, m, p, v):
if c > m:
return probs(m, c, p, v)
if c < EPS:
if v >= m:
... | IMPORT ASSIGN VAR NUMBER FUNC_DEF RETURN FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR VAR RETURN FUNC_CALL VAR VAR VAR VAR VAR IF VAR VAR IF VAR VAR RETURN LIST VAR BIN_OP NUMBER VAR RETURN BIN_OP LIST VAR BIN_OP BIN_OP NUMBER VAR VAR VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | answers = []
def solve(c, m, p, v):
queue = [[1, 1, [c, m, p]]]
ans = 0
while queue:
prevProb, count, array = queue.pop()
length = len(array)
ans += prevProb * count * array[-1]
if length == 1:
continue
for i in range(length - 1):
prob = arra... | ASSIGN VAR LIST FUNC_DEF ASSIGN VAR LIST LIST NUMBER NUMBER LIST VAR VAR VAR ASSIGN VAR NUMBER WHILE VAR ASSIGN VAR VAR VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR BIN_OP BIN_OP VAR VAR VAR NUMBER IF VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER ASSIGN VAR VAR VAR ASSIGN VAR NUMBER IF VAR VAR ASSIGN VAR VAR... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def dfs(c, m, p, v, op):
if c == 0 and m == 0:
return op * 1.0
sum = 0.0
sum = sum + p / 1000000.0 * op * 1.0
if c != 0:
if c < v:
if m == 0:
sum = sum + c / 1000000.0 * dfs(0, 0, p + c, v, op + 1)
else:
sum = sum + c / 1000000.0 * ... | FUNC_DEF IF VAR NUMBER VAR NUMBER RETURN BIN_OP VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP BIN_OP BIN_OP VAR NUMBER VAR NUMBER IF VAR NUMBER IF VAR VAR IF VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP BIN_OP VAR NUMBER FUNC_CALL VAR NUMBER NUMBER BIN_OP VAR VAR VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_O... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | a = 0
def dp(c, m, p, v, h, ans):
global a
a += h * p * ans
if c > 0 + 1e-09:
if m < 1e-09:
y = dp(c - min(c, v), m, p + min(c, v), v, h + 1, ans * c)
else:
y = dp(
c - min(c, v), m + min(c, v) / 2, p + min(c, v) / 2, v, h + 1, ans * c
)
... | ASSIGN VAR NUMBER FUNC_DEF VAR BIN_OP BIN_OP VAR VAR VAR IF VAR BIN_OP NUMBER NUMBER IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP VAR FUNC_CALL VAR VAR VAR VAR BIN_OP VAR FUNC_CALL VAR VAR VAR VAR BIN_OP VAR NUMBER BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR BIN_OP VAR FUNC_CALL VAR VAR VAR BIN_OP VAR BIN_OP FUNC_CALL VAR... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | ans = []
eps = 1e-06
for _ in range(int(input())):
c, m, p, v = map(float, input().split())
cur = p
pr = [(1, c, m, p)]
st = 1
while len(pr) > 0:
st += 1
pr1 = []
for i in range(len(pr)):
cur_pr, c, m, p = pr[i]
if c > eps:
if c > v:
... | ASSIGN VAR LIST ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR ASSIGN VAR LIST NUMBER VAR VAR VAR ASSIGN VAR NUMBER WHILE FUNC_CALL VAR VAR NUMBER VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR FUNC_CALL VAR VAR ASSIG... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
eps = 1e-05
def expect(c, m, p, v, itr):
if abs(c) < eps and abs(m) < eps:
return itr * p
if abs(c) < eps:
mv = max(m - v, 0)
return itr * p + m * expect(0, mv, p + m - mv, v, itr + 1)
if abs(m) < eps:
cv = max(c - v, 0)
return itr * p + c * expect(cv, 0... | IMPORT ASSIGN VAR NUMBER FUNC_DEF IF FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR RETURN BIN_OP VAR VAR IF FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER RETURN BIN_OP BIN_OP VAR VAR BIN_OP VAR FUNC_CALL VAR NUMBER VAR BIN_OP BIN_OP VAR VAR VAR VAR BIN_OP VAR NUMBER IF FUNC_CALL VAR VAR VAR ASSIGN ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def calc(a, v):
n = len(a)
ans = 0
for i in range(n):
if a[i] > v + 1e-10:
b = a.copy()
b[i] -= v
if n == 2:
b[1 - i] += v / n
ans += (calc(b, v) + 1) * a[i]
elif n == 2:
ans += (calc([a[1 - i] + a[i] / 2], v) + 1) *... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR IF VAR VAR BIN_OP VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR VAR IF VAR NUMBER VAR BIN_OP NUMBER VAR BIN_OP VAR VAR VAR BIN_OP BIN_OP FUNC_CALL VAR VAR VAR NUMBER VAR VAR IF VAR NUMBER VAR BIN_OP BIN_OP FUNC_CALL VAR LIST BIN_OP VAR BIN_... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
def expect(c, m, p, v):
l = 1e-06
res = 0
res += p
if m > v and c > l:
res += (1 + expect(c + v / 2, m - v, p + v / 2, v)) * m
if c > v and m > l:
res += (1 + expect(c - v, m + v / 2, p + v / 2, v)) * c
if m <= v and m > l and c > l:
res += (1 + expect(... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR NUMBER ASSIGN VAR NUMBER VAR VAR IF VAR VAR VAR VAR VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER VAR VAR IF VAR VAR VAR VAR VAR BIN_OP BIN_OP NUMBER FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_O... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
def calc(a, b, c, v, s):
if a == 0 and b == 0:
return c * s
eps = 10**-8
res = 0
if a > eps:
l = min(a, v)
if b > eps:
res += a * calc(a - l, b + l / 2, c + l / 2, v, s + 1)
else:
... | IMPORT ASSIGN VAR VAR EXPR FUNC_CALL VAR BIN_OP NUMBER NUMBER FUNC_DEF IF VAR NUMBER VAR NUMBER RETURN BIN_OP VAR VAR ASSIGN VAR BIN_OP NUMBER NUMBER ASSIGN VAR NUMBER IF VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR VAR VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NU... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | from sys import setrecursionlimit
blanck = []
def rec(a, b, c, v, p, card):
if a == 0 and b == 0 or c >= 1:
blanck.append(p * card)
return
l = [a, b, c]
for i in range(3):
if i != 2 and l[i] > 1e-08:
if i == 0:
ta = l[i]
dd = min(l[i], v... | ASSIGN VAR LIST FUNC_DEF IF VAR NUMBER VAR NUMBER VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR RETURN ASSIGN VAR LIST VAR VAR VAR FOR VAR FUNC_CALL VAR NUMBER IF VAR NUMBER VAR VAR NUMBER IF VAR NUMBER ASSIGN VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
def is_zero(x):
return abs(x) < 1e-09
def EV(x, y, z, v):
if is_zero(x) and is_zero(y):
return 1
elif is_zero(x):
step = min(y, v)
return 1 + y * EV(x, y - step, z + step, v)
elif is_zero(y):
step = min(x, v)
return 1 + x * EV(x - step, y, z +... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR NUMBER FUNC_DEF IF FUNC_CALL VAR VAR FUNC_CALL VAR VAR RETURN NUMBER IF FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR RETURN BIN_OP NUMBER BIN_OP VAR FUNC_CALL VAR VAR BIN_OP VAR VAR BIN_OP VAR VAR VAR IF FUNC_CALL VAR VAR ASSIGN VAR FUNC_CAL... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | zero = 1e-06
def f(c, m, p, v, i, prob):
if 1 - p <= zero:
return 0
a1 = 0
c1 = c
m1 = m
p1 = p
prob1 = prob
if c > zero:
o = min(c, v)
if m > zero:
m, p = m + o / 2, p + o / 2
else:
p = p + o
prob = prob * c
a1 = i * ... | ASSIGN VAR NUMBER FUNC_DEF IF BIN_OP NUMBER VAR VAR RETURN NUMBER ASSIGN VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR IF VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR VAR ASSIGN VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def func(c, m, p, v, n):
ans = p * (n + 1)
if c > x:
a = min(c, v)
if m > x:
ans += c * func(c - a, m + a / 2, p + a / 2, v, n + 1)
else:
ans += c * func(c - a, m, p + a, v, n + 1)
if m > x:
a = min(m, v)
if c > x:
ans += m * func(c... | FUNC_DEF ASSIGN VAR BIN_OP VAR BIN_OP VAR NUMBER IF VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR VAR VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR VAR BIN_OP VAR VAR VAR BIN_OP VAR NUMBER IF VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
for _ in range(t):
c, m, p, v = map(float, input().split())
def dp(c, m, p):
ans = 1
if c > 1e-06:
ch = min(c, v)
nc = c - ch
nm = m + ch / 2
np = p + ch / 2
if m < 1e-06:
nm = m
np += c... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP VAR NUMBER IF VAR NUM... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def f(a, c):
if a <= 1e-06:
return 0
else:
return c / 2
def dfs(c, m, p, v, step, sum):
ans = p * step * sum
if c >= 1e-06:
if c < v:
ans = ans + dfs(c - c, m + f(m, c), p + c - f(m, c), v, step + 1, c * sum)
else:
ans = ans + dfs(c - v, m + f(m,... | FUNC_DEF IF VAR NUMBER RETURN NUMBER RETURN BIN_OP VAR NUMBER FUNC_DEF ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR IF VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR FUNC_CALL VAR VAR VAR BIN_OP BIN_OP VAR VAR FUNC_CALL VAR VAR VAR VAR BIN_OP VAR NUMBER BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def dfs(c, m, p, n, k):
global v, res
res += p * n * k
if c > 1e-06 and m > 1e-06:
if c >= v:
dfs(c - v, m + v / 2, p + v / 2, n * c, k + 1)
else:
dfs(0, m + c / 2, p + c / 2, n * c, k + 1)
if m >= v:
dfs(c + v / 2, m - v, p + v / 2, n * m, k + 1)
... | FUNC_DEF VAR BIN_OP BIN_OP VAR VAR VAR IF VAR NUMBER VAR NUMBER IF VAR VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR VAR BIN_OP VAR NUMBER IF ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def help(c, m, p, v, count, h):
global ans
if c < 1e-06:
c = 0
if m < 1e-06:
m = 0
if c == 0 and m == 0:
ans = ans + p * count * h
return
ans = ans + h * p * count
x, y, z = c, m, p
if c != 0:
if m != 0:
if c <= v:
m = m + c... | FUNC_DEF IF VAR NUMBER ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR NUMBER IF VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR BIN_OP BIN_OP VAR VAR VAR RETURN ASSIGN VAR BIN_OP VAR BIN_OP BIN_OP VAR VAR VAR ASSIGN VAR VAR VAR VAR VAR VAR IF VAR NUMBER IF VAR NUMBER IF VAR VAR ASSIGN VAR BIN_OP VAR BIN_OP VAR NUMBER ASSIGN VA... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def expected(c, m, p, v):
E = 1.0
if c > 1e-07:
if m <= 1e-07:
E += c * expected(c - min(c, v), m, p + min(c, v), v)
else:
E += c * expected(
c - min(c, v), m + min(c, v) / 2.0, p + min(c, v) / 2.0, v
)
if m > 1e-07:
if c <= 1e-07:
... | FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER IF VAR NUMBER VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR FUNC_CALL VAR VAR VAR VAR BIN_OP VAR FUNC_CALL VAR VAR VAR VAR VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR FUNC_CALL VAR VAR VAR BIN_OP VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER BIN_OP VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER VAR IF... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | delta = 1e-12
def recur(a, b, c, d, cur=1):
assert abs(a + b + c - 1) < delta * 0.1, f"{a} {b} {c}"
a, b = sorted([a, b])
if a > delta:
A = (
recur(
max(a - d, 0), b + min(a / 2, d / 2), c + min(a / 2, d / 2), d, cur + 1
)
* a
)
else:... | ASSIGN VAR NUMBER FUNC_DEF NUMBER FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR VAR NUMBER BIN_OP VAR NUMBER VAR STRING VAR STRING VAR ASSIGN VAR VAR FUNC_CALL VAR LIST VAR VAR IF VAR VAR ASSIGN VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP VAR FUNC_CALL VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER BIN_OP... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | prob = 0
v = 0
def rec(c, m, p, val, num):
global prob
global v
prob += val * p * num
if p < 0.999994:
if c > 1e-06:
if c > v:
if m > 1e-06:
rec(c - v, m + v / 2, p + v / 2, val * c, num + 1)
else:
rec(c - v, 0... | ASSIGN VAR NUMBER ASSIGN VAR NUMBER FUNC_DEF VAR BIN_OP BIN_OP VAR VAR VAR IF VAR NUMBER IF VAR NUMBER IF VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP VAR VAR BIN_OP VAR ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def solve():
c, m, p, v = map(float, input().split())
def rec1(a, p, cur, r):
cur += 1
ans = cur * p * r
if a > 1e-08:
if a >= v:
ans += rec1(a - v, p + v, cur, r * a)
else:
ans += rec1(0, p + a, cur, r * a)
return ans
... | FUNC_DEF ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR IF VAR NUMBER IF VAR VAR VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR VAR VAR BIN_OP VAR VAR VAR FUNC_CALL VAR NUMBER BIN_OP VAR VAR VAR BIN_OP VAR VAR RETURN VAR FUNC_DEF VAR NUMBER ASSIGN ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
for _ in range(t):
def f(c, m, p, v):
if c <= v:
if m > 0:
return -1, m + c / 2, p + c / 2, v
else:
return -1, -1, 10000, v
elif m > 0:
return c - v, m + v / 2, p + v / 2, v
else:
return c - v, ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR FUNC_DEF IF VAR VAR IF VAR NUMBER RETURN NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR RETURN NUMBER NUMBER NUMBER VAR IF VAR NUMBER RETURN BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR RETURN BIN_OP V... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | r = 1000000000.0
def check(c, m, p, v, l):
ans = p / r * l
if c > 0:
if c > v:
if m > 0:
ans += c / r * check(c - v, m + v / 2, p + v / 2, v, l + 1)
else:
ans += c / r * check(c - v, 0, p + v, v, l + 1)
elif m > 0:
ans += c / ... | ASSIGN VAR NUMBER FUNC_DEF ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR IF VAR NUMBER IF VAR VAR IF VAR NUMBER VAR BIN_OP BIN_OP VAR VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER VAR BIN_OP BIN_OP VAR VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP VAR VAR VAR B... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
input = sys.stdin.readline
shift = 10**4
ans = 0
def solve(c, m, p, v, races, prob):
global ans
ans += (races + 1) * prob * p / shift
if c > v:
if m == 0:
solve(c - v, 0, p + v, v, races + 1, prob * c / shift)
else:
solve(c - v, m + v / 2, p + v / 2, v, ... | IMPORT ASSIGN VAR VAR ASSIGN VAR BIN_OP NUMBER NUMBER ASSIGN VAR NUMBER FUNC_DEF VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR NUMBER VAR VAR VAR IF VAR VAR IF VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP VAR VAR VAR BIN_OP VAR NUMBER BIN_OP BIN_OP VAR VAR VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
sys.setrecursionlimit(10**5)
result = 0
eps = 1e-09
def pink(c, m, p, v, prob, step):
global result, eps
if c > eps:
if c - v > eps:
if m > eps:
pink(c - v, m + v / 2, p + v / 2, v, prob * c, step + 1)
else:
pink(c - v, m, p + v, v, p... | IMPORT EXPR FUNC_CALL VAR BIN_OP NUMBER NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER FUNC_DEF IF VAR VAR IF BIN_OP VAR VAR VAR IF VAR VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR BIN_OP VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR VAR BIN_OP VAR VAR VA... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | scale = 10**6
def calculate_expectation(c, m, p, v):
expectation = 1
if c != 0:
if c <= v:
if m != 0:
expectation += (
c / scale * calculate_expectation(0, m + c / 2, p + c / 2, v)
)
else:
expectation += c / sc... | ASSIGN VAR BIN_OP NUMBER NUMBER FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER IF VAR VAR IF VAR NUMBER VAR BIN_OP BIN_OP VAR VAR FUNC_CALL VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR VAR BIN_OP VAR VAR IF VAR NUMBER VAR BIN_OP BIN_OP VAR VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUM... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
sys.stderr = sys.stdout
K = 1000000
def solve(c, m, p, v):
log("c", c, "m", m, "p", p, "v", v)
c = int(round(c * K))
m = int(round(m * K))
p = int(round(p * K))
v = int(round(v * K))
log("c", c, "m", m, "p", p, "v", v)
v2 = v // 2
S = [(c, m, p, 1.0)]
t = 0.0
while ... | IMPORT ASSIGN VAR VAR ASSIGN VAR NUMBER FUNC_DEF EXPR FUNC_CALL VAR STRING VAR STRING VAR STRING VAR STRING VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
THR = 1e-09
def calc(c, m, p, v, n):
ans = p * n
if c < THR and m < THR:
return ans
if c >= 0:
if c > v:
if m < THR:
ans += c * calc(c - v, -1, p + v, v, n + 1)
else:
ans += c * calc(c - v, m + v / 2, p + v / 2, v, n ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR NUMBER FUNC_DEF ASSIGN VAR BIN_OP VAR VAR IF VAR VAR VAR VAR RETURN VAR IF VAR NUMBER IF VAR VAR IF VAR VAR VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER BIN_OP VAR VAR VAR BIN_OP VAR NUMBER VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER B... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def process(c, m, p, v):
d = {"": [1, (c, m, p), (True, True, True)]}
I = 1
answer = 0
while len(d) > 0:
d2 = {}
for x in d:
prob, t, R = d[x]
c2, m2, p2 = t
c_r, m_r, p_r = R
for i in range(3):
if i == 0 and R[0]:
... | FUNC_DEF ASSIGN VAR DICT STRING LIST NUMBER VAR VAR VAR NUMBER NUMBER NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER WHILE FUNC_CALL VAR VAR NUMBER ASSIGN VAR DICT FOR VAR VAR ASSIGN VAR VAR VAR VAR VAR ASSIGN VAR VAR VAR VAR ASSIGN VAR VAR VAR VAR FOR VAR FUNC_CALL VAR NUMBER IF VAR NUMBER VAR NUMBER ASSIGN VAR STRING IF ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def main():
c, m, p, v = map(float, input().split())
eps = 10**-9
def dfs(cnt, x, c, m, p):
cnt += 1
ret = 0
ret = x * p * cnt
if c != 0:
if c < v + eps:
if m == 0:
... | IMPORT ASSIGN VAR VAR EXPR FUNC_CALL VAR BIN_OP NUMBER NUMBER FUNC_DEF ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP NUMBER NUMBER FUNC_DEF VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR IF VAR NUMBER IF VAR BIN_OP VAR VAR IF VAR NUMBER VAR FUNC_CALL VAR VAR BIN_O... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def solve(c, m, p, v, cnt):
if 1 - p < 1e-05:
return cnt
ret = 0
if c >= 1e-05 and m >= 1e-05:
if c <= v:
ret += c * solve(0, m + c / 2, p + c / 2, v, cnt + 1)
else:
ret += c * solve(c - v, m + v / 2, p + v / 2, v, cnt + 1)
if m <= v:
ret +... | FUNC_DEF IF BIN_OP NUMBER VAR NUMBER RETURN VAR ASSIGN VAR NUMBER IF VAR NUMBER VAR NUMBER IF VAR VAR VAR BIN_OP VAR FUNC_CALL VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER VAR BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def E(c, m, p, v):
ans = 0
if p > 1e-06:
ans += p
if c > 1e-06:
m2 = m
p2 = p
if m > 1e-06 and p > 1e-06:
m2 += min(c, v) / 2
p2 += min(c, v) / 2
elif p > 1e-06:
p2 += min(c, v)
ans += c * (1 + E(max(c - v, 0), m2, p2, v))
... | FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER VAR VAR IF VAR NUMBER ASSIGN VAR VAR ASSIGN VAR VAR IF VAR NUMBER VAR NUMBER VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER VAR BIN_OP FUNC_CALL VAR VAR VAR NUMBER IF VAR NUMBER VAR FUNC_CALL VAR VAR VAR VAR BIN_OP VAR BIN_OP NUMBER FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR NUMBER VAR... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | T = int(input())
for t in range(T):
[c, m, p, v] = list(map(float, input().split()))
def dp(c, m, p, k):
if c < 1e-06:
c = 0
if m < 1e-06:
m = 0
a = min(c, v)
b = min(m, v)
if c == 0 and m == 0:
return (k + 1) * p
if m == 0:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN LIST VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR NUMBER ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR IF VAR NUMBER VAR NUMBER RETURN ... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def rec(c, m, p, v):
ret = 0
ret += p * 0
if 0 < m <= v + 1e-05:
tmp = 0
if c > 0:
tmp = rec(c + m / 2, 0, p + m / 2, v)
else:
tmp = rec(0, 0, 1, v)
ret += m * tmp
elif m > v:
tmp = 0
if c > 0:
tmp = rec(c + v / 2, m - v... | FUNC_DEF ASSIGN VAR NUMBER VAR BIN_OP VAR NUMBER IF NUMBER VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR FUNC_CALL VAR BIN_OP VAR BIN_OP VAR NUMBER NUMBER BIN_OP VAR BIN_OP VAR NUMBER VAR ASSIGN VAR FUNC_CALL VAR NUMBER NUMBER NUMBER VAR VAR BIN_OP VAR VAR IF VAR VAR ASSIGN VAR NUMBER IF VAR NUMBER A... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | cache = {}
def expected(P, v):
c, m, p = P
ans = p
if 0 < c:
P1 = [c, m, p]
if c <= v:
P1 = [0, 0, p + c] if m == 0 else [0, m + c / 2, p + c / 2]
if c > v:
P1 = [c - v, 0, p + v] if m == 0 else [c - v, m + v / 2, p + v / 2]
ans += c * (1 + expected(... | ASSIGN VAR DICT FUNC_DEF ASSIGN VAR VAR VAR VAR ASSIGN VAR VAR IF NUMBER VAR ASSIGN VAR LIST VAR VAR VAR IF VAR VAR ASSIGN VAR VAR NUMBER LIST NUMBER NUMBER BIN_OP VAR VAR LIST NUMBER BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR BIN_OP VAR NUMBER IF VAR VAR ASSIGN VAR VAR NUMBER LIST BIN_OP VAR VAR NUMBER BIN_OP VAR VAR LIS... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | def f(c, m, p, v):
if abs(1 - p) < 10**-7:
return 1
if c < 10**-7:
ans = 0
if m - v > 0:
ans += m * (f(0, m - v, p + v, v) + 1)
else:
ans += m * 2
ans += p
return ans
elif m < 10**-7:
ans = 0
if c > v:
ans +=... | FUNC_DEF IF FUNC_CALL VAR BIN_OP NUMBER VAR BIN_OP NUMBER NUMBER RETURN NUMBER IF VAR BIN_OP NUMBER NUMBER ASSIGN VAR NUMBER IF BIN_OP VAR VAR NUMBER VAR BIN_OP VAR BIN_OP FUNC_CALL VAR NUMBER BIN_OP VAR VAR BIN_OP VAR VAR VAR NUMBER VAR BIN_OP VAR NUMBER VAR VAR RETURN VAR IF VAR BIN_OP NUMBER NUMBER ASSIGN VAR NUMBER... |
After defeating a Blacklist Rival, you get a chance to draw $1$ reward slip out of $x$ hidden valid slips. Initially, $x=3$ and these hidden valid slips are Cash Slip, Impound Strike Release Marker and Pink Slip of Rival's Car. Initially, the probability of drawing these in a random guess are $c$, $m$, and $p$, respect... | t = int(input())
def eşittir(a, b):
if round(a, 9) == round(b, 9):
return True
return False
for i in range(t):
c, m, p, v = map(float, input().split(" "))
stack = [(c, m, p, v, 1, 1)]
res = 0
while len(stack) != 0:
c, m, p, v, dismiss, turn = stack.pop()
dismiss = dis... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF IF FUNC_CALL VAR VAR NUMBER FUNC_CALL VAR VAR NUMBER RETURN NUMBER RETURN NUMBER FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR LIST VAR VAR VAR VAR NUMBER NUMBER ASSIGN VAR NUMBER WHILE FUNC_CALL VAR VAR NUMBE... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.