code stringlengths 3 6.57k |
|---|
binary_search() |
necessary(i) |
print(binary_search() |
a() |
map(int, sys.stdin.readline() |
split() |
print((a + b) |
b() |
map(int, sys.stdin.read() |
split() |
np.array(I) |
reshape(-1, 2) |
np.absolute(ab[:, None] - cd) |
sum(axis=-1) |
c() |
int(sys.stdin.readline() |
rstrip() |
NumberTheory.find_divisors(n) |
print(len(str(divs[bi_l(divs, math.sqrt(n) |
d() |
map(int, sys.stdin.read() |
split() |
v.sort() |
print(sum(v[-a:]) |
bi_l(v, v[-a]) |
bi_r(v, v[-a]) |
c(r - l, i) |
range(r - n + a, r - max(l, n - b) |
c(r - l, r - n + a) |
a() |
map(int, sys.stdin.readline() |
split() |
print("YES" if c - b == b - a else "NO") |
b() |
sys.stdin.read() |
split() |
range(len(t) |
len(s) |
len(t) |
print(a) |
c() |
sys.stdin.read() |
split() |
map(Counter, s) |
res.items() |
min(x, counter[c]) |
sorted(res.items() |
print(t) |
d() |
map(int, sys.stdin.read() |
split() |
np.array(xy[:n]) |
np.array(xy[n:]) |
np.arange(n) |
np.cumsum(x) |
sum() |
np.arange(m) |
np.cumsum(y) |
sum() |
a() |
initial(s) |
upper() |
print("".join(map(initial, sys.stdin.readline() |
split() |
b() |
sys.stdin.read() |
split() |
len(a) |
len(b) |
c() |
map(int, sys.stdin.read() |
split() |
range(n) |
range(n) |
print(min(c1, c2) |
d() |
map(int, sys.stdin.readline() |
split() |
print("Brown" if abs(x - y) |
a() |
sys.stdin.readline() |
split() |
print("YES" if a[-1] == b[0] and b[-1] == c[0] else "NO") |
b() |
map(int, sys.stdin.readline() |
split() |
print("NO" if c % NumberTheory.gcd(a, b) |
c() |
map(int, sys.stdin.read() |
split() |
print(sum(min(a[i + 1] - a[i], t) |
range(n - 1) |
d() |
a() |
map(int, sys.stdin.readline() |
split() |
print("Yes" if a <= c <= b else "No") |
b() |
map(int, sys.stdin.read() |
split() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.