code stringlengths 3 6.57k |
|---|
b() |
map(int, sys.stdin.read() |
split() |
print(sorted(set(a) |
c() |
map(int, sys.stdin.readline() |
split() |
list(sys.stdin.readline() |
rstrip() |
range(n - 1) |
range(i + 1, n) |
heappush(q, (s[j], cost[i] + cost[j], -j) |
heappop(q) |
print("".join(s) |
d() |
map(int, sys.stdin.readline() |
split() |
np.array([int(x) |
sys.stdin.readline() |
split() |
np.array([int(x) |
sys.stdin.readline() |
split() |
np.eye(k, k, -1, dtype=np.uint32) |
print(a[m - 1]) |
print(Algebra.bitwise_mat_pow(d, m-k) |
print(Algebra.bitwise_dot(Algebra.bitwise_mat_pow(d, m-k) |
reshape(-1, 1) |
item() |
Algebra.bitwise_mat_pow(d, m - k) |
reshape(-1, 1) |
a() |
print(sys.stdin.readline() |
rstrip() |
b() |
map(int, sys.stdin.read() |
split() |
print(tot) |
c() |
map(int, sys.stdin.read() |
split() |
np.array(xy) |
reshape(-1, 2) |
dist(x1, y1, x2, y2) |
np.sqrt((x2 - x1) |
if (dist(sx, sy, x, y) |
dist(x, y, gx, gy) |
any() |
print(ans) |
d() |
map(int, sys.stdin.readline() |
split() |
int(x) |
sys.stdin.readline() |
split() |
range(e) |
map(int, sys.stdin.readline() |
split() |
x.append(a) |
y.append(b) |
x.append(b) |
y.append(a) |
x.append(a) |
y.append(n) |
print(0) |
len(x) |
csr_matrix((c, (x, y) |
print(min_cut) |
d_2() |
map(int, sys.stdin.readline() |
split() |
nx.DiGraph() |
graph.add_nodes_from(range(n + 1) |
int(x) |
sys.stdin.readline() |
split() |
graph.add_edge(p, n, capacity=1) |
range(e) |
map(int, sys.stdin.readline() |
split() |
graph.add_edge(a, b, capacity=1) |
graph.add_edge(b, a, capacity=1) |
print(nx.minimum_cut_value(graph, 0, n) |
d_3() |
map(int, sys.stdin.readline() |
split() |
GeometryTopology.Graph(n + 1) |
range(n+1) |
g.add_node(i) |
int(x) |
sys.stdin.readline() |
split() |
g.add_edge(p, n, capacity=1) |
zip(*[map(int, sys.stdin.read() |
split() |
g.add_edge(a, b, capacity=1) |
g.add_edge(b, a, capacity=1) |
print(g.dinic(0, n) |
a() |
int(sys.stdin.readline() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.