code stringlengths 3 6.57k |
|---|
print(l) |
c() |
set("dream, dreamer, erase, eraser".split(", ") |
obtainable(s) |
range(5, 8) |
sys.stdin.readline() |
rstrip() |
print("YES" if obtainable(s) |
d() |
map(int, sys.stdin.readline() |
split() |
GeometryTopology.Graph(n) |
uf1.init_dsu() |
GeometryTopology.Graph(n) |
uf2.init_dsu() |
add_edges(uf, m) |
range(m) |
map(int, sys.stdin.readline() |
split() |
uf.unite(x, y) |
add_edges(uf1, k) |
add_edges(uf2, l) |
defaultdict(list) |
range(n) |
uf1.find(i) |
uf2.find(i) |
append(i) |
len(g[a]) |
print(*res, sep=" ") |
a() |
print(eval(sys.stdin.readline() |
rstrip() |
b() |
int(sys.stdin.readline() |
rstrip() |
np.array(sys.stdin.readline() |
split() |
map(int, sys.stdin.read() |
split() |
np.array(px) |
reshape(m, 2) |
print(*(t.sum() |
c() |
map(int, sys.stdin.read() |
split() |
Counter(a) |
all(a[i] == 2 for i in range(2, n, 2) |
print(0) |
any(a[i] != 2 for i in range(1, n, 2) |
print(0) |
print(pow(2, n // 2, MOD) |
d() |
a() |
print(" ".join(sys.stdin.readline() |
rstrip() |
split(",") |
b() |
map(int, sys.stdin.readline() |
split() |
range(k + 1) |
print(tot) |
c() |
map(int, sys.stdin.readline() |
split() |
d() |
map(int, sys.stdin.read() |
split() |
np.arange(n) |
np.array(abc) |
reshape(m, 3) |
csr_matrix((c, (a, b) |
astype(np.int64) |
sum() |
a() |
map(int, sys.stdin.readline() |
split() |
print(max(a * b, c * d) |
b() |
sys.stdin.read() |
split() |
int(n) |
range(n) |
print(max(a) |
c() |
int(sys.stdin.readline() |
rstrip() |
NumberTheory.PrimeNumbers(n) |
pn.factorize_factorial(n) |
values() |
print(s) |
d() |
map(int, sys.stdin.read() |
split() |
np.array(x) |
print(np.minimum((x[1:] - x[:-1]) |
sum() |
a() |
int(sys.stdin.readline() |
rstrip() |
b() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.