|:---------------|:----------------------|:---------| | misc | sample | ✅ | | math | sort | ✅ | | math | catalan_number | ✅ | | math | combination | ❓ | | math | counting_primes | ✅ | | math | euler_phi | ❓ | | math | ext_gcd | ❓ | | math | fact_comb_perm | ❓ | | math | flt | ❓ | | math | gcd_lcm | ❓ | | math | lcm_list_mod | ❓ | | math | mod_int | ❓ | | math | prime_factorize | ✅ | | math | rep_pow | ✅ | | math | sieve_of_eratosthenes | ✅ | | math | mex | ❓ | | basic | bin_search_value | ✅ | | basic | bit_full_search | ❓ | | basic | cnt_multiple | ❓ | | basic | cum_sum | ❓ | | basic | lis | ❓ | | basic | two_dim_sum | ❓ | | basic | sample_generator | ❓ | | convolution | convolution | ❓ | | data_structure | RMQ | ❓ | | data_structure | RSQ | ❓ | | data_structure | segtree | ❓ | | data_structure | segtree_kai | ❓ | | data_structure | union_find | ✅ | | data_structure | weighted_union_find | ❓ | | data_structure | multiset | ✅ | | data_structure | associative_array | ❓ | | data_structure | predecessor_problem | ❓ | | dp | LCS | ❓ | | dp | levenshtein_dist | ❓ | | dp | count_substring | ✅ | | dp | traveling_salesman | ❓ | | graph | bfs | ❓ | | graph | dfs | ❓ | | graph | dijkstra | ❓ | | graph | max_flow | ❓ | | graph | prim | ❓ | | graph | warshall_floyd | ❓ | | graph | ford_fulkerson | ❓ | | graph | dinic | ❓ | | graph | matching | ❓ | | string | z_algorithm | ❓ | | utils | create_snippet | ❓ | | sample | a_plus_b | ❓ | | sample | many_a_plus_b | ❓ |