Tag: competitive programming
20 posts tagged with competitive programming
- Read ModInt
ModInt
Perform modular arithmetic with a ModInt wrapper.
2024/08/133 min read
romophic - Read romophic-library
romophic-library
Library for Competitive Programming
2024/07/3091 min read31 subpostsromophic - Read BellmanFord
BellmanFord
Find single-source shortest paths with Bellman-Ford, including negative-weight edges.
2024/07/303 min readromophic - Read BigInt
BigInt
Arbitrary-precision integer arithmetic for values beyond 64-bit limits.
2024/07/308 min readromophic - Read Dijkstra
Dijkstra
Find single-source shortest paths in non-negative weighted graphs.
2024/07/302 min readromophic - Read DirectedGraph
DirectedGraph
Represent and traverse directed graphs.
2024/07/302 min readromophic - Read getFarthestVertex(最遠頂点を求める)
getFarthestVertex(最遠頂点を求める)
Find the farthest vertex from a source by graph traversal.
2024/07/302 min readromophic - Read getGraphDiameter(木の直径を求める)
getGraphDiameter(木の直径を求める)
Compute a tree's diameter with two graph traversals.
2024/07/302 min readromophic - Read Kruskal
Kruskal
Build a minimum spanning tree with Kruskal's algorithm.
2024/07/302 min readromophic - Read Mo's Algorithm
Mo's Algorithm
Answer offline range queries efficiently with Mo's algorithm.
2024/07/303 min readromophic - Read 文字列のith以降で文字cが出現する最小のindex
文字列のith以降で文字cが出現する最小のindex
Precompute the next occurrence of each character in a string.
2024/07/302 min readromophic - Read RollingHash
RollingHash
Compare substrings in constant time with rolling hashes.
2024/07/304 min readromophic - Read 強連結成分分解(SCC)
強連結成分分解(SCC)
Find strongly connected components in a directed graph.
2024/07/304 min readromophic - Read SuffixArray
SuffixArray
Build a suffix array for fast substring and pattern queries.
2024/07/304 min readromophic - Read TopologicalSort
TopologicalSort
Order a directed acyclic graph with topological sorting.
2024/07/302 min readromophic - Read UndirectedGraph
UndirectedGraph
Represent and traverse undirected graphs.
2024/07/301 min readromophic - Read WarshallFloyd
WarshallFloyd
Find all-pairs shortest paths with Warshall-Floyd.
2024/07/303 min readromophic - Read 繰り返し二乗法
繰り返し二乗法
Compute powers modulo m in O(log n) with binary exponentiation.
2024/07/291 min readromophic - Read 二分探索
二分探索
Find boundaries in sorted arrays with binary search.
2024/07/292 min readromophic - Read chmax/chmin
chmax/chmin
Update values in place with the chmax and chmin helpers.
2024/07/291 min readromophic