issues
search
idat50me
/
cpp_lib
C++ ライブラリかも
https://idat50me.github.io/cpp_lib/
0
stars
1
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
BITの改善案
#22
idat50me
opened
20 hours ago
0
Suffix Array
#21
idat50me
closed
3 weeks ago
3
遅延セグ木の使用例
#20
idat50me
opened
5 months ago
0
segment set で [a, b] と [b+1, c] を結合するかどうか
#19
idat50me
opened
11 months ago
0
Encrypt/Decrypt token
#18
kzrnm
closed
1 year ago
2
座圧ライブラリ
#17
idat50me
opened
1 year ago
0
転倒数を求める時に重複を許すかどうか
#16
idat50me
opened
1 year ago
0
経路復元するダイクストラ
#15
idat50me
closed
10 months ago
0
全方位木DP
#14
idat50me
opened
3 years ago
1
正方行列
#13
idat50me
closed
3 years ago
1
segtree.out()
#12
idat50me
opened
3 years ago
0
Dinic法の実装
#11
idat50me
opened
3 years ago
1
mincostflow をポテンシャル法を用いたダイクストラ法で実装する
#10
idat50me
closed
3 years ago
2
New Docs
#9
idat50me
closed
5 months ago
0
Union Find のマージテクで頂点の swap 関数をラムダ式の引数でとる
#8
idat50me
closed
3 years ago
2
ModInt + int(ll)
#7
idat50me
closed
3 years ago
1
強連結成分分解(SCC)
#6
idat50me
opened
3 years ago
0
matrix.make() -> .resize()
#5
idat50me
closed
3 years ago
2
ModIntの逆元の計算法を拡張ユークリッド互除法でやる
#4
idat50me
closed
3 years ago
1
セグ木関連
#3
idat50me
opened
3 years ago
1
素因数分解 O(n^(1/4))
#2
idat50me
opened
3 years ago
0
Ford Fulkersonに最小費用流追加
#1
idat50me
closed
3 years ago
4