code stringlengths 3 6.57k |
|---|
sys.stdin.readline() |
rstrip() |
print(len(s) |
s.find("A") |
find("Z") |
c() |
int(sys.stdin.readline() |
rstrip() |
divmod(x, 11) |
print(2 * q + (r + 5) |
d() |
map(int, sys.stdin.read() |
split() |
print(n - ((n - len(set(a) |
a() |
f(x) |
return (x + 11) |
map(int, sys.stdin.readline() |
split() |
print("Alice" if f(a) |
f(b) |
f(a) |
f(b) |
b() |
map(int, sys.stdin.readline() |
split() |
sys.stdin.readline() |
rstrip() |
range(n) |
sys.stdin.readline() |
rstrip() |
range(m) |
range(n - m + 1) |
range(n - m + 1) |
range(m) |
range(m) |
print("Yes") |
print("No") |
c() |
map(int, sys.stdin.read() |
split() |
GeometryTopology.Graph(n) |
zip(*[iter(ab) |
g.add_edge(a, b) |
g.add_edge(b, a) |
stack.pop() |
stack.append((v, s | 1 << v) |
print(cnt) |
d() |
map(int, sys.stdin.read() |
split() |
np.full((401, 401) |
zip(*[iter(abc) |
np.minimum(dp[a:, b:], dp[:-a, :-b] + c, out=dp[a:, b:]) |
np.arange(1, 400 // max(ma, mb) |
min() |
print(int(res) |
a() |
int(sys.stdin.readline() |
rstrip() |
print(800 * n - 200 * (n // 15) |
b() |
int(sys.stdin.readline() |
rstrip() |
Algebra.generate_fac_ifac(n, MOD) |
print(fac[-1]) |
c() |
map(int, sys.stdin.readline() |
split() |
print(m // 2 if m <= 2 * n else n + (m - 2 * n) |
d() |
sys.stdin.read() |
split() |
int(n) |
possible(t) |
range(1, n - 1) |
possible(t) |
print("".join("S" if x == 1 else "W" for x in t) |
print(-1) |
a() |
to_i(c) |
map(to_i, sys.stdin.readline() |
split() |
print("D" if a ^ b else "H") |
b() |
map(int, sys.stdin.readline() |
split() |
print(max(b - (a + w) |
c() |
int(sys.stdin.readline() |
rstrip() |
print(int(math.ceil(math.sqrt(2 * x + 1 / 4) |
d() |
map(int, sys.stdin.read() |
split() |
sorted(min(x, k) |
necessary(i) |
np.zeros(k, dtype=np.bool) |
range(n) |
np.any(dp[k - a[i] :]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.