| .. |
|
ACAutomaton.cpp
|
a1e4552858
add AC Automaton
|
%!s(int64=8) %!d(string=hai) anos |
|
BFS_DFS.cpp
|
bc9f0099e7
add DFS and BFS
|
%!s(int64=8) %!d(string=hai) anos |
|
BIT.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
BellmanFord.cpp
|
7b7ce12a78
add Bellman-Ford
|
%!s(int64=8) %!d(string=hai) anos |
|
BiggestRectangle.cpp
|
bb210ec772
add BiggestRectangle
|
%!s(int64=8) %!d(string=hai) anos |
|
BitSet.cpp
|
e85fefd91c
add test() to bit sets
|
%!s(int64=8) %!d(string=hai) anos |
|
ConvexHull.cc
|
070c75ed89
modification convex hull
|
%!s(int64=8) %!d(string=hai) anos |
|
Dates.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
Delaunay.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
Dichotomie.cpp
|
c3a5bf80db
add dichotomie
|
%!s(int64=8) %!d(string=hai) anos |
|
Dinic.cc
|
341a4a1911
compress Dinic
|
%!s(int64=8) %!d(string=hai) anos |
|
Euclid.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
FFT.cpp
|
fc138a4481
Change FFT
|
%!s(int64=8) %!d(string=hai) anos |
|
FastDijkstra.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
GaussJordan.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
Geometry.cc
|
32958f16d1
Add intersection of half-plane in geometry
|
%!s(int64=8) %!d(string=hai) anos |
|
Inversion.cpp
|
972e363866
add inversion
|
%!s(int64=8) %!d(string=hai) anos |
|
KDTree.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
LongestIncreasingSubsequence.cc
|
6fa98342e0
Mark Longest Increasing Subsequence buggued
|
%!s(int64=8) %!d(string=hai) anos |
|
Makefile
|
0ea3cdcd66
Add unit test for SegmentTree
|
%!s(int64=8) %!d(string=hai) anos |
|
MaxBipartiteMatching.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
MaxBipartiteMatching_sqrt.cc
|
a63533d4ed
ajout de MaxBipartiteMatching_sqrt.cc
|
%!s(int64=8) %!d(string=hai) anos |
|
MinCostMatching.cc
|
76279ec9b2
change MinCostMatching
|
%!s(int64=8) %!d(string=hai) anos |
|
MinCostMaxFlow.cc
|
fdec3b3b34
error MinCostMaxFlow
|
%!s(int64=8) %!d(string=hai) anos |
|
MinCut.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
Primes.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
PushRelabel.cc
|
7b6433cbb6
change PushRelabel
|
%!s(int64=8) %!d(string=hai) anos |
|
RabinKarp.cpp
|
7917cbe0d5
add Rabin-Karp 2D
|
%!s(int64=8) %!d(string=hai) anos |
|
ReducedRowEchelonForm.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
SCC.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
SegmentTree.cpp
|
7e9fc5d223
change segment tree
|
%!s(int64=8) %!d(string=hai) anos |
|
SegmentTree_test.cpp
|
0ea3cdcd66
Add unit test for SegmentTree
|
%!s(int64=8) %!d(string=hai) anos |
|
Simplex.cc
|
3e346777ad
change Simplex
|
%!s(int64=8) %!d(string=hai) anos |
|
SuffixArray.cc
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
|
Tips.cpp
|
af3362e077
fix filename
|
%!s(int64=8) %!d(string=hai) anos |
|
UnionFind.cc
|
0fea1cf8f8
change union find
|
%!s(int64=8) %!d(string=hai) anos |
|
kmp.cpp
|
0ad62c9fe5
change KMP
|
%!s(int64=8) %!d(string=hai) anos |
|
suffix.cpp
|
c06ab66ef7
Base de Jill-Jenn https://bitbucket.org/jilljenn/acm/src
|
%!s(int64=8) %!d(string=hai) anos |
Olivier Marty
0ea3cdcd66
Add unit test for SegmentTree