code stringlengths 3 6.57k |
|---|
heappush(queue, (rate[i], k, i) |
heappush(infants[k], (-rate[i], i) |
transfer(i, k) |
heappop(infants[now]) |
heappush(queue, (-r, now, j) |
heappush(infants[now], (r, j) |
entry(i, k) |
inquire() |
heappop(queue) |
heappush(queue, (r, k, i) |
range(n) |
map(int, sys.stdin.readline() |
split() |
entry(i, b - 1) |
range(q) |
map(int, sys.stdin.readline() |
split() |
transfer(c - 1, d - 1) |
print(inquire() |
a() |
sys.stdin.readline() |
rstrip() |
print("A" if c < "a" else "a") |
b() |
map(int, sys.stdin.read() |
split() |
print(sum(sorted(p) |
c() |
int(sys.stdin.readline() |
rstrip() |
pow(26, l) |
pow(26, l) |
chr(ord("a") |
NumberTheory.base_convert(n, 26) |
len(res) |
print(res) |
d() |
int(sys.stdin.readline() |
rstrip() |
int(x) |
sys.stdin.readline() |
split() |
sum(a) |
Counter(a) |
int(sys.stdin.readline() |
rstrip() |
range(q) |
map(int, sys.stdin.readline() |
split() |
print(s) |
e() |
map(int, sys.stdin.read() |
split() |
map(lambda x: x ^ s, a) |
print(*b, sep=" ") |
a() |
int(sys.stdin.readline() |
rstrip() |
print(a * (1 + a + a**2) |
b() |
sys.stdin.read() |
split() |
print(sum(s[i] != t[i] for i in range(len(s) |
c() |
map(int, sys.stdin.readline() |
split() |
int(x) |
sys.stdin.readline() |
split() |
int(x) |
sys.stdin.readline() |
split() |
itertools.accumulate(a) |
itertools.accumulate(b) |
range(n + 1) |
max(res, i + bi_r(sb, r) |
print(res) |
d() |
int(sys.stdin.readline() |
rstrip() |
np.zeros(n + 1, dtype=np.int64) |
range(1, n + 1) |
print((np.arange(1, n + 1) |
sum() |
a() |
int(sys.stdin.readline() |
rstrip() |
print(charge) |
b() |
sys.stdin.read() |
split() |
Counter(s) |
split(", ") |
print(f"{v} x {c[v]}") |
c() |
map(int, sys.stdin.readline() |
split() |
sys.stdin.readline() |
rstrip() |
range(h) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.