code stringlengths 3 6.57k |
|---|
np.cumsum(a, out=a) |
sum() |
print(s) |
d() |
map(int, sys.stdin.read() |
split() |
paths(k) |
divmod(k, w) |
paths(k - 1) |
paths(k + 1) |
paths(k - w) |
paths(k + w) |
print(sum(paths(i) |
range(h * w) |
a() |
sys.stdin.readline() |
rstrip() |
print("YES" if s[-1] == "T" else "NO") |
b() |
map(int, sys.stdin.read() |
split() |
print("YES" if a == c or b == c or a == d or b == d else "NO") |
c() |
map(int, sys.stdin.read() |
split() |
range(n) |
print(cnt) |
d() |
map(int, sys.stdin.read() |
split() |
zip(*[iter(wh) |
print(bi_l(DP.LIS(a) |
a() |
map(int, sys.stdin.readline() |
split() |
print((a * b + b * c + c * a) |
b() |
int(sys.stdin.readline() |
rstrip() |
range(1, int(x**0.5) |
pow(n, 4) |
print(n) |
c() |
split(", ") |
sys.stdin.readline() |
rstrip() |
print(convert[board.index(s) |
d() |
map(int, sys.stdin.readline() |
split() |
join(sys.stdin.read() |
split() |
set() |
range(h * w) |
if (i + 1) |
range(-w, w + 1, w) |
range(l, r + 1) |
set(range(h * w) |
set() |
if (i + 1) |
range(-w, w + 1, w) |
range(l, r + 1) |
set(range(h * w) |
range(h * w) |
print("impossible") |
print("possible") |
range(h) |
range(w) |
a() |
map(int, sys.stdin.readline() |
split() |
print(min(x - 1, n - x) |
b() |
int(sys.stdin.readline() |
rstrip() |
range(1, int(n**0.5) |
min(res, n // i - i + n % i) |
print(res) |
c() |
map(int, sys.stdin.read() |
split() |
range(2, n + 1) |
abs(h[i] - h[i - 2]) |
abs(h[i] - h[i - 1]) |
print(cost[n]) |
d() |
map(int, sys.stdin.readline() |
split() |
GeometryTopology.Graph(n) |
uf.init_dsu() |
range(m) |
map(int, sys.stdin.readline() |
split() |
heappush(queue, (-(2 * y) |
int(sys.stdin.readline() |
rstrip() |
range(q) |
map(int, sys.stdin.readline() |
split() |
heappush(queue, (-(2 * y + 1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.