code stringlengths 3 6.57k |
|---|
self.factorize(i) |
items() |
lru_cache(maxsize=None) |
gcd(cls, a, b) |
cls.gcd(b, a % b) |
abs(a) |
lcm(cls, a, b) |
abs(a // cls.gcd(a, b) |
find_divisors(n) |
range(1, int(n**0.5) |
divisors.append(i) |
divisors.append(j) |
sorted(divisors) |
base_convert(n, b) |
divmod(n, b) |
res.append(r) |
lru_cache(maxsize=None) |
choose(cls, n, r, mod=None) |
cls.choose(n - 1, r, mod) |
cls.choose(n - 1, r - 1, mod) |
__init__(self, n=2 * 10**6, mod=MOD) |
Algebra.generate_fac_ifac(n, mod) |
__call__(self, n, r) |
self.__choose(n, r) |
__choose(self, n, r) |
make_nchoose_table(self, n) |
len(self.__fac) |
np.arange(n + 1, n - r, -1) |
Algebra.cumprod(n_choose, p) |
range(r) |
range(1, r + 1) |
permutations(cls, a, r=None, i=0) |
list(a) |
len(a) |
tuple(a[:r]) |
range(i, n) |
cls.permutations(a, r, i + 1) |
combinations(a, r) |
tuple(a) |
len(a) |
list(range(r) |
range(r - 1, -1, -1) |
range(i + 1, r) |
tuple(a[i] for i in indices) |
LIS(a) |
len(a) |
bi_l(res, x) |
z_algorithm(s) |
len(s) |
range(1, n) |
min(a[i - l], r - i) |
__init__(self, weight=1, capacity=1, **args) |
__str__(self) |
__init__(self, **args) |
__init__(self, n=0) |
range(n) |
add_node_info(self, v, **args) |
self.__Node(**args) |
add_edge(self, u, v, update=False, **args) |
self.__Edge(**args) |
get_size(self) |
bfs(self, src=0) |
deque([src]) |
q.popleft() |
items() |
q.append(v) |
dinic(self, src, sink) |
flow_to_sink(u, flow_in) |
items() |
flow_to_sink(v, min(flow_in, e.capacity) |
self.add_edge(v, u, capacity=f) |
self.bfs(src) |
flow_to_sink(src, inf) |
ford_fulkerson(self) |
push_relabel(self) |
floyd_warshall(self) |
range(n) |
range(n) |
items() |
range(n) |
range(n) |
range(n) |
min(d[u][v], d[u][w] + d[w][v]) |
dijkstra(self, src, paths_cnt=False, mod=None) |
heappop(q) |
items() |
heappush(q, (dv, v) |
astar(self, src, tgt, heuristic_func) |
heuristic_func(src, tgt) |
heappop(q) |
items() |
heuristic_func(v, tgt) |
heappush(q, (h + nc, nc, v) |
bellman_ford(self, src) |
range(n - 1) |
range(n) |
items() |
min(d[v], d[u] + e.weight) |
range(n) |
items() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.