code stringlengths 3 6.57k |
|---|
print(l, r) |
range(m + 1) |
print(l, r) |
d() |
map(int, sys.stdin.read() |
split() |
np.array(a) |
np.zeros((k + 1, n) |
range(k) |
b.sum(axis=1) |
pow(2, mod - 2, mod) |
Combinatorics.CombinationsMod(mod=mod) |
range(1, k + 1) |
np.arange(x + 1) |
c(x, l) |
sum() |
pow(2, x, mod) |
e() |
f() |
a() |
map(int, sys.stdin.read() |
split() |
zip(*[iter(xy) |
print(xy) |
t() |
a() |
int(sys.stdin.readline() |
rstrip() |
print(8 - x // 200) |
b() |
map(int, sys.stdin.read() |
split() |
print("Yes" if r < g < b else "No") |
c() |
map(int, sys.stdin.read() |
split() |
range(k, n) |
print("Yes" if a[i] > a[i - k] else "No") |
d() |
map(int, sys.stdin.read() |
split() |
range(n) |
print(m) |
a() |
int(sys.stdin.readline() |
rstrip() |
range(t) |
map(int, sys.stdin.readline() |
split() |
print(a ^ b) |
b() |
int(sys.stdin.readline() |
rstrip() |
range(t) |
int(sys.stdin.readline() |
rstrip() |
list(sys.stdin.readline() |
rstrip() |
range(n) |
range(n) |
range(n) |
int(s[i][j]) |
can_goal(g, c=0) |
stack.pop() |
stack.append((i, j) |
not (can_goal(s, 0) |
can_goal(s, 1) |
print(0) |
range(n) |
range(n) |
not (can_goal(s, 0) |
can_goal(s, 1) |
print(1) |
print(i + 1, j + 1) |
print(2) |
print(n, n - 1) |
print(n - 1, n) |
print(1, 2) |
print(n - 1, n) |
print(1, 2) |
print(n, n - 1) |
c() |
p1() |
f(n, x) |
return (x + n // x * x) |
f(n - 1, 3) |
f(n - 1, 5) |
f(n - 1, 15) |
print(ans) |
p2() |
fib.append(fib[-1] + fib[-2]) |
print(sum(fib[1:-1:3]) |
p3() |
NumberTheory.PrimeNumbers() |
pn.factorize(600851475143) |
print(max(res.keys() |
p4() |
is_palindrome(n) |
str(n) |
range(100, 1000) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.