code stringlengths 3 6.57k |
|---|
rstrip() |
print(n % 12 + 1) |
b() |
sys.stdin.readline() |
rstrip() |
print(s[0].upper() |
lower() |
c() |
map(int, sys.stdin.read() |
split() |
set(ng) |
print("NO") |
print("NO") |
range(3, 0, -1) |
if (n - i) |
print("NO") |
print("YES") |
d() |
map(int, sys.stdin.read() |
split() |
abs(x) |
abs(y) |
print(0) |
print(0) |
pow(1 / 2, n) |
range(r // 2 + 1) |
comb(n, south, exact=True) |
comb(n - south, north, exact=True) |
comb(n - south - north, west, exact=True) |
print(res) |
a() |
map(int, sys.stdin.readline() |
split() |
print(b, a) |
b() |
int(sys.stdin.readline() |
rstrip() |
divmod(n, 3600) |
divmod(n, 60) |
print(f"{h:02}:{m:02}:{s:02}") |
c() |
int(sys.stdin.readline() |
rstrip() |
range(1, 10) |
res.append(f"{i} x {n//i}") |
print(*sorted(res) |
d() |
map(int, sys.stdin.read() |
split() |
np.array(abt) |
reshape(m, 3) |
csr_matrix((t, (a - 1, b - 1) |
print(res.max(axis=-1) |
min() |
astype(np.int64) |
d_2() |
map(int, sys.stdin.read() |
split() |
GeometryTopology.Graph(n) |
zip(*[iter(abt) |
g.add_edge(a, b, weight=t) |
g.add_edge(b, a, weight=t) |
print(min(max(d) |
g.floyd_warshall() |
a() |
print(ord(sys.stdin.readline() |
rstrip() |
ord("A") |
b() |
map(int, sys.stdin.read() |
split() |
abs(a - b) |
print(min(d, 10 - d) |
c() |
map(int, sys.stdin.read() |
split() |
np.arange(n + 1) |
np.maximum(x, 0, out=x) |
np.minimum(x, n - y, out=x) |
print(np.amin(a * x + c * y) |
d() |
map(int, sys.stdin.read() |
split() |
list(range(n) |
swap(i, j) |
swap(i - 1, i) |
np.array(res) |
binary_method(a, p) |
np.arange(n) |
print(*(binary_method(res, d) |
a() |
map(int, sys.stdin.read() |
split() |
print((a + b - 1) |
b() |
map(int, sys.stdin.read() |
split() |
print(sum(a[i] for i in range(n) |
c() |
map(int, sys.stdin.read() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.