code stringlengths 3 6.57k |
|---|
possible(c) |
print(binary_search() |
a() |
map(int, sys.stdin.readline() |
split() |
print("NO" if (10 * g + b) |
b() |
map(int, sys.stdin.read() |
split() |
a.sort() |
print(a[-1] - a[0]) |
c() |
map(int, sys.stdin.read() |
split() |
np.bincount(np.minimum(np.array(a) |
np.count_nonzero(a[:-1]) |
max(mx - a[-1], 1) |
print(mn, mx) |
d() |
sys.stdin.read() |
split() |
print("(" * l + s + ") |
a() |
map(int, sys.stdin.readline() |
split() |
print("delicious" if y <= 0 else "safe" if y <= x else "dangerous") |
b() |
int(x) |
sys.stdin.read() |
split() |
range(n) |
print(c + 1) |
print(-1) |
c() |
map(int, sys.stdin.readline() |
split() |
abs(n - m) |
print(0) |
Algebra.generate_fac_ifac(10**5) |
print(fac[n] * fac[m] * (1 if d else 2) |
d() |
map(int, sys.stdin.read() |
split() |
np.array(xy) |
reshape(n, 2) |
np.argsort(x) |
np.argsort(y) |
np.hstack([ax, ay]) |
np.hstack([bx, by]) |
np.hstack([cx, cy]) |
np.argsort(e[-1]) |
np.unique(e[:-1], return_index=True, axis=1) |
minimum_spanning_tree(csr_matrix((c, (a, b) |
astype(np.int64) |
sum() |
d_2() |
map(int, sys.stdin.read() |
split() |
GeometryTopology.Graph(n) |
make(a) |
sorted(enumerate(a) |
range(n - 1) |
g.add_edge(u, v, weight=w) |
min(g.edges[u][v].weight, w) |
make(x) |
make(y) |
g.kruskal() |
g.prim() |
g.boruvka() |
print(d) |
a() |
print(sum(sorted(map(int, sys.stdin.readline() |
split() |
b() |
sys.stdin.readline() |
rstrip() |
f(s) |
len(s) |
range(len(s) |
f(s[:i]) |
print(i) |
c() |
map(int, sys.stdin.read() |
split() |
deque() |
range(n) |
b.appendleft(a[i]) |
b.append(a[i]) |
b.reverse() |
print(*b) |
d() |
map(int, sys.stdin.read() |
split() |
range(n + 1) |
np.arange(1, n + 2) |
Combinatorics.CombinationsMod(n + 1, MOD) |
print(*((c(n + 1, k) |
c(d, k - 1) |
a() |
b() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.