code stringlengths 3 6.57k |
|---|
sum(axis=-1) |
sum(axis=1) |
print(d[1] / d[0]) |
a() |
print(sum(divmod(int(sys.stdin.readline() |
rstrip() |
b() |
sys.stdin.read() |
split() |
int(n) |
range(n // 2) |
print(n // 2 if t == s else -1) |
b_2() |
sys.stdin.read() |
split() |
int(n) |
print(-1) |
list("abc") |
print(-1) |
print(n // 2) |
c() |
map(int, sys.stdin.read() |
split() |
np.array(rc) |
reshape(n, 2) |
np.bincount(r, minlength=h) |
np.bincount(c, minlength=w) |
np.bincount(rb, minlength=k + 1) |
np.bincount(cb, minlength=k + 1) |
sum() |
np.bincount(rb[r] + cb[c] - 1, minlength=k + 1) |
print(tot - real[k - 1] + real[k]) |
d() |
map(int, sys.stdin.read() |
split() |
np.array(hs) |
reshape(n, 2) |
np.arange(n) |
is_ok(x) |
np.all(np.sort((x - h) |
binary_search() |
is_ok(x) |
print(binary_search() |
a() |
map(int, sys.stdin.read() |
split() |
print(a * s + b * t - c * (s + t) |
b() |
map(int, sys.stdin.read() |
split() |
np.array(a) |
print(np.minimum(a[1:] - a[:-1], t) |
sum() |
c() |
map(int, sys.stdin.read() |
split() |
np.array(lrst) |
reshape(d, 2) |
reshape(k, 2) |
np.zeros((k,) |
range(d) |
print(*day, sep="\n") |
d() |
map(int, sys.stdin.read() |
split() |
pow(a * b % p - b * c % p + c * a % p, p - 2, p) |
print(h, w) |
a() |
sys.stdin.read() |
split() |
int(n) |
divmod(n - 1, 5) |
print(s[i] + s[j]) |
b() |
map(int, sys.stdin.readline() |
split() |
defaultdict(int) |
range(n) |
sys.stdin.readline() |
split() |
int(d) |
min(max(d, a) |
print(ans) |
c() |
range(2) |
map(int, sys.stdin.readline() |
split() |
range(3) |
range(3) |
map(int, sys.stdin.readline() |
split() |
range(2) |
sum(b) |
sum(c) |
lru_cache(maxsize=None) |
f(s=tuple(0 for _ in range(9) |
all(s) |
range(6) |
range(8) |
range(9) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.