icpc-book
Book Code for ICPC; Unmaintained, see https://github.com/kth-competitive-programming/kactl/ or https://github.com/ecnerwala/cp-book
File Explorer
Download Latest Version (.zip)- kactl.tex
- kactlpkg.sty
- kactlprocessor.py
- kth.pdf
- mit.png
- mit_bw.png
- test-session.tex
- chapter.tex
- techniques.txt
- binomialModPrime.h
- chapter.tex
- factorial.tex
- IntPerm.h
- multinomial.h
- nim-product-table.txt
- nim-product.cpp
- schreier-sims.cpp
- chapter.tex
- hash-cpp.sh
- hash.sh
- kactl_bashrc
- kactl_vimrc
- Makefile
- nanorc
- template.cpp
- troubleshoot.txt
- vimrc
- vimrc-symbols
- chapter.tex
- FenwickTree.h
- FenwickTree2d.h
- HashMap.h
- LazySegmentTree.h
- LCT.cpp
- LineContainer.h
- Matrix.h
- OrderStatisticTree.h
- RMQ.h
- SegmentTree.h
- SubMatrix.h
- Treap.h
- UnionFind.h
- 3dHull.h
- Angle.h
- angleCmp.h
- chapter.tex
- CircleIntersection.h
- circleTangents.h
- circleTangents.pdf
- circumcircle.h
- circumcircle.pdf
- closestPair.h
- ConvexHull.h
- ConvexHull.pdf
- DelaunayTriangulation.h
- FastDelaunay.h
- halfPlane.h
- insidePolygon.h
- kdTree.h
- linearTransformation.h
- linearTransformation.pdf
- lineDistance.h
- lineDistance.pdf
- LineHullIntersection.h
- lineIntersection.h
- lineIntersection.pdf
- MinimumEnclosingCircle.h
- onSegment.h
- Point.h
- Point3D.h
- PointInsideHull.h
- PolygonArea.h
- PolygonCenter.h
- PolygonCut.h
- PolygonCut.pdf
- PolygonDiameter.h
- PolyhedronVolume.h
- SegmentDistance.h
- SegmentDistance.pdf
- SegmentIntersection.h
- SegmentIntersection.pdf
- SegmentIntersectionQ.h
- sideOf.h
- sphericalDistance.h
- 2sat.h
- bellmanFord.h
- BiconnectedComponents.h
- blossom.h
- chapter.tex
- CompressTree.h
- cycle-counting.cpp
- DFSMatching.h
- directed-MST.cpp
- EdmondsKarp.h
- EulerWalk.h
- FloydWarshall.h
- GeneralMatching.h
- GlobalMinCut.h
- graph-clique.cpp
- graph-dominator-tree.cpp
- graph-negative-cycle.cpp
- HLD.h
- hopcroftKarp.h
- LCA.h
- LinkCutTree.h
- MatrixTree.h
- MaximalCliques.h
- MinCostMaxFlow.h
- MinCut.h
- MinimumVertexCover.h
- PushRelabel.h
- SCC.h
- TopoSort.h
- TreePower.h
- WeightedMatching.h
- chapter.tex
- oldchapter.tex
- sphericalCoordinates.pdf
- chapter.tex
- chapter.tex
- chinese.h
- ContinuedFractions.h
- eratosthenes.h
- euclid.h
- Euclid.java
- factor.h
- FracBinarySearch.h
- MillerRabin.h
- ModInverse.h
- ModMulLL.h
- ModPow.h
- ModSqrt.h
- ModSum.h
- ModularArithmetic.h
- phiFunction.h
- BerlekampMassey.h
- chapter.tex
- Determinant.h
- FastFourierTransform.h
- FastSubsetTransform.h
- fft.cpp
- GoldenSectionSearch.h
- HillClimbing.h
- IntDeterminant.h
- Integrate.h
- IntegrateAdaptive.h
- LinearRecurrence.h
- math-simplex.cpp
- MatrixInverse-mod.h
- MatrixInverse.h
- NumberTheoreticTransform.h
- poly-exp-log.cpp
- PolyInterpolate.h
- Polynomial.h
- PolyRoots.h
- Simplex.h
- SolveLinear.h
- SolveLinear2.h
- SolveLinearBinary.h
- Tridiagonal.h
- AhoCorasick.h
- chapter.tex
- extended-KMP.h
- Hashing-codeforces.h
- Hashing.h
- KMP.h
- Manacher.h
- MinRotation.h
- string-dc3.cpp
- string-sa+lcp.cpp
- string-SAM.cpp
- SuffixArray.h
- SuffixTree.h
- chapter.tex
- BumpAllocator.h
- BumpAllocatorSTL.h
- chapter.tex
- ConstantIntervals.h
- DivideAndConquerDP.h
- Hashmap.h
- IntervalContainer.h
- IntervalCover.h
- Karatsuba.h
- KnuthDP.h
- LCS.h
- LIS.h
- Main.java
- SIMD.h
- SmallPtr.h
- TernarySearch.h
- Unrolling.h
- acmlib-2002.pdf
- kactl-2003.pdf
- README
- tinykactl-2004.pdf
- tinykactl-2007.pdf
- example.h
- README
- strategy.pdf
- strategy.tex
- berlekamp-massey.cpp
- binomial.cpp
- continued-fractions.cpp
- fast-delaunay.cpp
- fft.cpp
- frac-binary-search.cpp
- fst.cpp
- ft2d.cpp
- fw.cpp
- hull-intersection.cpp
- idet.cpp
- interval-container.cpp
- kmp.cpp
- lazy-segment-tree.cpp
- line-container.cpp
- linear-recurrence.cpp
- link-cut.cpp
- maximal-cliques.cpp
- mcmf.cpp
- min-rotation.cpp
- MinCostMaxFlow2.h
- minimum-enclosing-circle.cpp
- modinv.cpp
- modsqrt.cpp
- modsum.cpp
- modular-arithmetic.cpp
- ntt.cpp
- point-in-hull.cpp
- polygon-area.cpp
- polygon-cut.cpp
- polygon-diameter.cpp
- primes.cpp
- rmq.cpp
- scc.cpp
- segment-tree.cpp
- solvelinear-binary.cpp
- solvelinear.cpp
- solvelinear2.cpp
- treap.cpp
- triangulation.cpp
- tridiagonal.cpp
- two-sat.cpp
- vertex-cover.cpp
- mit_kactl.pdf
- latexmkrc
- notebook.pdf
- notebook.tex
- test_binomialMod.cpp
- test_multinomial.cpp
- Matrix.in
- test_intervalUnion.cpp
- test_Matrix.cpp
- test_segmentTree.cpp
- test_unionFind.cpp
- convexHull.data
- insidePolygon.in
- lineDistDouble.in
- randPolygon.cpp
- segDistDouble.in
- segDistInt.in
- segmentIntersectionDouble.in
- segmentIntersectionInt.in
- test_circleTangents.cpp
- test_circumcircle.cpp
- test_convexHull.cpp
- test_insidePolygon.cpp
- test_linearTransformation.cpp
- test_lineDistDouble.cpp
- test_lineIntersection.cpp
- test_polygonArea.cpp
- test_polygonCenter.cpp
- test_polygonCut.cpp
- test_segDistDouble.cpp
- test_segDistInt.cpp
- test_segmentIntersectionDouble.cpp
- test_segmentIntersectionInt.cpp
- test_sideOf.cpp
- test_sphericalDistance.cpp
- Matching.in
- test_DFSMatching.cpp
- test_hopcroftKarp.cpp
- test_factor.cpp
- test_binarySearch.cpp
- test_goldenSectionSearch.cpp
- test_tridiagonal.cpp
- KMP.in
- SA-generator.cpp
- SA.in
- test_KMP.cpp
- test_SuffixArray.cpp
- convexHull.data
- insidePolygon.in
- KMP.in
- lineDistDouble.in
- segDistDouble.in
- segDistInt.in
- segmentIntersectionDouble.in
- segmentIntersectionInt.in
- global.h
- UnitTest.h
- UnitTestManager.cpp
- UnitTestManager.h
- UnitTestWrapper.h
- data_structure_hld.cpp
- data_structure_kdtree_xyz.cpp
- data_structure_LCT.cpp
- data_structure_persistent_treap_xhr.cpp
- data_structure_splay_7k+.cpp
- data_structure_splay_xhr.cpp
- data_structure_ๆ ็ถๆฐ็ปไบๅ.cpp
- geometry_2dhull.cc
- geometry_3dhull.cc
- geometry_all.cpp
- geometry_circle_union.cpp
- geometry_hfi.cpp
- geometry_mindisc.cc
- geometry_misc.txt
- geometry_nwerc07flight.cpp
- graph_bcc_cutpoint.cpp
- graph_chordal.txt
- graph_clique.cpp
- graph_dinic.cpp
- graph_dominator_tree.cpp
- graph_euler.cpp
- graph_flow_remove_neg_cost.png
- graph_flow_removing_lower_bound.png
- graph_general_graph_matching.cpp
- graph_hungary.cc
- graph_km.cpp
- graph_kosaraju+2sat.cc
- graph_mincostflow_7k+.cc
- graph_sap_7k+.cc
- graph_tarjan_scc.cpp
- graph_zkwflow.cpp
- graph_ๆพ่ดๅ.cpp
- graph_ๆๅฐๆ ๅฝขๅพ.cpp
- math_bsgs.cpp
- math_cg.png
- math_FWT.cpp
- math_integral.png
- math_LP_duality.png
- math_LP_duality_2.png
- math_miller_rabin_pollard.cpp
- math_misc.txt
- math_nim็งฏ.cpp
- math_pcg.png
- math_pell.py
- math_poly_badmod.cpp
- math_poly_goodmod.cpp
- math_poly_multipt.cpp
- math_simplex.cpp
- math_Tonelli-Shanks.cpp
- misc_common_bug_list.txt
- misc_fast_input.cpp
- misc_java.java
- misc_temp.cpp
- misc_zeller.cpp
- misc_ๅ่พนๅฝขไธ็ญๅผ.txt
- string_acautomata.cpp
- string_ext_kmp.cpp
- string_palindromic_tree.cpp
- string_sa+lcp.cpp
- string_SAM
- string_SAM.cpp
- string_ๅญ็ฌฆไธฒๆๅฐๅพช็ฏ่กจ็คบ.cpp
- ext_kmp1(hdu 4333).cpp
- ext_kmp2(hdu 3068).cpp
- fft(plus).cpp
- kmp(poj2406).cpp
- km็ฎๆณ๏ผ็็็งปๅจ๏ผ.cpp
- LCT1(zjoi2011้้ฆไนๆ).cpp
- zkw_่ดน็จๆต๏ผ็็็งปๅจ๏ผ.cpp
- ๅ็ผๆฐ็ป1๏ผbzoj1031๏ผ.cpp
- ๅ็ผๆฐ็ป2๏ผspoj705๏ผ.cpp
- ๅ็ถๆ (count).cpp
- ๆ ้พๅๅ๏ผcount๏ผ.cpp
- ็บฟๆง่งๅ๏ผ็็็งปๅจ๏ผ.cpp
- ็บฟๆฎตๆ ๏ผflights๏ผ.cpp
- .DS_Store
- 2-SAT(m).cpp
- 2-SAT(nm).cpp
- 2่ฟๅถๆๅคดdp.cpp
- 3่ฟๅถๆๅคดdp.cpp
- AC่ชๅจๆบ.cpp
- AlphaBeta.cpp
- Bernoulli_number.cpp
- fastIO.cpp
- fread.cpp
- inv.cpp
- kd_tree.cpp
- km็ฎๆณ.cpp
- miller_rabinไธpollard_rhoไธๅฟซ้ไนๆณ.cpp
- newsplay.cpp
- nim็งฏ.cpp
- SEQ2.cpp
- TonelliโShanks.cpp
- zkw_่ดน็จๆต.cpp
- zkw็บฟๆฎตๆ .cpp
- ๅ จๅฑๅนณ่กกไบๅๆ .cpp
- ๅๆฒปไนๆณ.cpp
- ๅๅๆ .cpp
- ๅๅนณ้ขไบค.cpp
- ๅ็ผๅนณ่กกๆ .cpp
- ๅ็ผๆฐ็ป.cpp
- ๅ็ผ่ชๅจๆบ.cpp
- ๅญ็ฌฆไธฒๆๅฐๅพช็ฏ่กจ็คบ.cpp
- ๅฎๆฐFFT.cpp
- ๅธฆ่ฑๆ .cpp
- ๅนณ้ขๅพ็นๅฎไฝ.cpp
- ๆฉๅฑ็ฆปๆฃๅฏนๆฐ.cpp
- ๆซๆ็บฟ็นๅฎไฝ.cpp
- ๆ้.cpp
- ๆดๆฐFFT.cpp
- ๆๆณข้ฃๅฅๅ .cpp
- ๆๅฐๆ ๅฝขๅพ.cpp
- ๆ ็ถๆฐ็ปไบๅ.cpp
- ๆจก็.cpp
- ็นๅ.cpp
- ็ฅๅฅ็treap.cpp
- ็ด ๆฐๅคๅฎ.txt
- ็บฟๆง่งๅ.cpp
- ่พนๅๆฒป.cpp
- ้ๆบๅๅข้ๆณ.cpp
- .DS_Store
- .DS_Store
- FFT_tutorial.pdf
- .gitignore
- header.tmp
- kactl.pdf
- LICENSE
- Makefile
- README.md
- test-compiles.sh
- test-session.pdf
// repository documentation
Was this content helpful?
(0 ratings)