code stringlengths 3 6.57k |
|---|
c() |
int(sys.stdin.readline() |
rstrip() |
NumberTheory.find_divisors(n) |
print(*div, sep="\n") |
d() |
map(int, sys.stdin.readline() |
split() |
print(cnt) |
print(cnt) |
e() |
map(int, sys.stdin.read() |
split() |
list(zip(*[iter(xyz) |
range(n) |
range(n) |
range(n) |
abs(p - a) |
abs(q - b) |
max(0, r - c) |
range(1 << n) |
range(1 << n) |
range(n) |
range(n) |
min(dp[t][i], dp[s][j] + dist[j][i]) |
print(dp[-1][0]) |
f() |
map(int, sys.stdin.readline() |
split() |
Combinatorics.CombinationsMod(n, MOD) |
np.zeros(n + 1, dtype=np.int64) |
range(3, n + 1) |
np.zeros(n + 1, dtype=np.int64) |
np.zeros((n + 1, m + 1) |
f(l) |
range(n) |
range(m + 1) |
np.arange(1, min(l, n - i, m - j + 1) |
c(n - i - 1, k - 1) |
np.arange(2, min(l, n - i, m - j) |
c(n - i - 1, k - 1) |
print((f(l) |
f(l - 1) |
f_2() |
map(int, sys.stdin.readline() |
split() |
Combinatorics.CombinationsMod(n, MOD) |
range(3, n + 1) |
f(l) |
range(n + 1) |
range(n) |
range(m + 1) |
range(1, min(l, n - i, m - j + 1) |
c(n - i - 1, k - 1) |
range(1, min(l, n - i, m - j) |
c(n - i - 1, k - 1) |
print((f(l) |
f(l - 1) |
a() |
int(sys.stdin.readline() |
rstrip() |
pow(3, a) |
pow(3, a) |
pow(5, b) |
pow(5, b) |
print(a, b) |
print(-1) |
b() |
map(int, sys.stdin.readline() |
split() |
int(x) |
sys.stdin.readline() |
split() |
int(x) |
sys.stdin.readline() |
split() |
GeometryTopology.Graph(n) |
uf.init_dsu() |
range(m) |
map(int, sys.stdin.readline() |
split() |
uf.unite(c, d) |
range(n) |
range(n) |
range(n) |
uf.find(i) |
append(a[i]) |
append(b[i]) |
all(sum(ga[i]) |
sum(gb[i]) |
range(n) |
c() |
map(int, sys.stdin.readline() |
split() |
print(-1) |
print(-1) |
print(1, 2) |
print(-1) |
print(l, r) |
range(n - 2 - m) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.