library

Library Files

DP

• DP/Knapsack.cpp
• DP/Knapsack01.cpp
• DP/LCS.cpp
• DP/LIS.cpp
• DP/Levenshtein.cpp
• DP/MaximumRectangle.cpp

DataStructure

• DataStructure/BinaryIndexedTree.cpp
• DataStructure/CulSum.cpp
• DataStructure/CulSum2D.cpp
• DataStructure/Imos.cpp
• DataStructure/Imos2D.cpp
• DataStructure/ImosLinear.cpp
• DataStructure/LazySegmentTree.cpp
• DataStructure/PartiallyPersistentUnionFind.cpp
• DataStructure/PersistentArray.cpp
• DataStructure/PersistentQueue.cpp
• DataStructure/PersistentStack.cpp
• DataStructure/PersistentUnionFind.cpp
• DataStructure/RangeSet.cpp
• DataStructure/SegmentTree.cpp
• DataStructure/UnionFind.cpp
• DataStructure/WeightedUnionFind.cpp

Geometry

• Geometry/Circle.hpp
• Geometry/Geometric.cpp
• Geometry/Geometric.hpp
• Geometry/Line.hpp
• Geometry/Polygon.hpp
• Geometry/Rect.hpp
• Geometry/Triangle.hpp
• Geometry/Vec2.hpp
• Geometry/area_of_intersection.cpp
• Geometry/closest_pair.cpp
• Geometry/common_tangent.cpp

Graph

• Graph/BellmanFord.cpp
• Graph/BipartiteGraph.cpp
• Graph/BipartiteMatching.cpp
• Graph/BuildTreePath.cpp
• Graph/BuildTreePathEdge.cpp
• Graph/ChinesePostman.cpp
• Graph/ConnectedComponent.cpp
• Graph/CycleDetection.cpp
• Graph/Diameter.cpp
• Graph/DiameterPath.cpp
• Graph/Dijkstra.cpp
• Graph/DijkstraBuildPath.cpp
• Graph/Dinic.cpp
• Graph/DirectedMinimumSpanningTree.cpp
• Graph/EulerTourForEdge.cpp
• Graph/EulerTourForVertex.cpp
• Graph/FlowTemplate.cpp
• Graph/FordFulkerson.cpp
• Graph/GraphTemplate.cpp
• Graph/HeavyLightDecomposition.cpp
• Graph/Kruskal.cpp
• Graph/LCA.cpp
• Graph/LowLink.cpp
• Graph/ReRooting.cpp
• Graph/ShortestPath.cpp
• Graph/ShortestPathTree.cpp
• Graph/SpanningTree.cpp
• Graph/StronglyConnectedComponents.cpp
• Graph/TopologicalSort.cpp
• Graph/TravelingSalesmanProblem.cpp
• Graph/WarashallFloyd.cpp
• Graph/isConnected.cpp

Utility

• Utility/BitRangeBasedFor.cpp
• Utility/BracketsPos.cpp
• Utility/Bsearch.cpp
• Utility/CharacterClass.cpp
• Utility/Combination.cpp
• Utility/Compress.cpp
• Utility/CountStraight.cpp
• Utility/Dice.cpp
• Utility/Mex.cpp
• Utility/Pair.cpp
• Utility/Point.cpp
• Utility/Printer.cpp
• Utility/Random.cpp
• Utility/Range.cpp
• Utility/Ruby.cpp
• Utility/RunLengthArray.cpp
• Utility/RunLengthEncoding.cpp
• Utility/Scanner.cpp
• Utility/Step.cpp
• Utility/StopWatch.cpp
• Utility/VectorOperation.cpp
• Utility/constants.cpp
• Utility/functions.cpp
• Utility/get_MOD.cpp
• Utility/oj_local.cpp
• Utility/splitRange.cpp
• Utility/stringOperation.cpp

atcoder

• atcoder/convolution.hpp
• atcoder/dsu.hpp
• atcoder/fenwicktree.hpp
• atcoder/internal_bit.hpp
• atcoder/internal_math.hpp
• atcoder/internal_queue.hpp
• atcoder/internal_scc.hpp
• atcoder/internal_type_traits.hpp
• atcoder/lazysegtree.hpp
• atcoder/math.hpp
• atcoder/maxflow.hpp
• atcoder/mincostflow.hpp
• atcoder/modint.hpp
• atcoder/scc.hpp
• atcoder/segtree.hpp
• atcoder/string.hpp
• atcoder/twosat.hpp

.

• dump.hpp
• template.cpp
• template_mini.cpp
• template_no_Ruby.cpp

math

• math/BabystepGiantstep.cpp
• math/Combination.cpp
• math/Divisors.cpp
• math/EnumerateCombination.cpp
• math/EnumeratePrimes.cpp
• math/Eratosthenes.cpp
• math/Euler.cpp
• math/Fibonacci.cpp
• math/Inversion.cpp
• math/Matrix.cpp
• math/Moebius.cpp
• math/Partition.cpp
• math/PrimeFactor.cpp
• math/QuadraticEquation.cpp
• math/Radix.cpp
• math/Rational.cpp
• math/Sieve.cpp
• math/extGcd.cpp
• math/isPrime.cpp
• math/modint.cpp
• math/modintRuntime.cpp

old

• old/RAQRMaxQ.cpp
• old/RAQRSQ.cpp
• old/RAQRminQ.cpp
• old/RAUQRSQ.cpp
• old/RUQRSQ.cpp
• old/RUQRminQ.cpp
• old/RangeAddQuery.cpp
• old/RangeUpdateQuery.cpp
• old/SegmentTree_old.cpp

search

• search/GridBFS.cpp

string

• string/RollingHash.cpp
• string/ZAlgorithm.cpp

Verification Files

old

• old/RAQRSQ.test.cpp
• old/RAQRminQ.test.cpp
• old/RUQRmQ.test.cpp
• old/RangeAddQuery.test.cpp
• old/RangeUpdateQuery.test.cpp

test

• test/ArticulationPoints.test.cpp
• test/BellmanFord.test.cpp
• test/BinaryIndexedTree.test.cpp
• test/BipartiteMatching.test.cpp
• test/BitRangeBasedFor.test.cpp
• test/Bridges.test.cpp
• test/Bsearch.test.cpp
• test/ChinesePostman.test.cpp
• test/ConnectedComponent.test.cpp
• test/CulSum.test.cpp
• test/CulSum2D.test.cpp
• test/CycleDetectionEdge_Directed.test.cpp
• test/CycleDetectionEdge_Undirected.test.cpp
• test/CycleDetectionVertex_Directed.test.cpp
• test/CycleDetectionVertex_Undirected.test.cpp
• test/Diameter.test.cpp
• test/Dice1.test.cpp
• test/Dice2.test.cpp
• test/Dice3.test.cpp
• test/Dice4.test.cpp
• test/Dijkstra.test.cpp
• test/DijkstraBuildPath.test.cpp
• test/Dinic.test.cpp
• test/DirectedMinimumSpanningTree.test.cpp
• test/Divisors.test.cpp
• test/EnumerateEuler.test.cpp
• test/EnumerateFibonacci.test.cpp
• test/EnumeratePrimes.test.cpp
• test/Eratosthenes.test.cpp
• test/Euler.test.cpp
• test/EulerTourForEdge.test.cpp
• test/Fibonacci.test.cpp
• test/FordFulkerson.test.cpp
• test/Geometric_area_of_intersection_between_circle_and_polygon.test.cpp
• test/Geometric_area_of_intersection_between_two_circles.test.cpp
• test/Geometric_cirnnumscribed_circle.test.cpp
• test/Geometric_closest_pair.test.cpp
• test/Geometric_common_tangent.test.cpp
• test/Geometric_convex_hull.test.cpp
• test/Geometric_cross_point_of_circles.test.cpp
• test/Geometric_cross_points_between_line_and_circle.test.cpp
• test/Geometric_dot_cross.test.cpp
• test/Geometric_iSP.test.cpp
• test/Geometric_incircle_of_triangle.test.cpp
• test/Geometric_is_convex.test.cpp
• test/Geometric_is_parallel_is_orthogonal.test.cpp
• test/Geometric_line_intersection.test.cpp
• test/Geometric_polygon_cut.test.cpp
• test/Geometric_polygon_diameter.test.cpp
• test/Geometric_polygon_point_containment.test.cpp
• test/Geometric_projection.test.cpp
• test/Geometric_reflection.test.cpp
• test/Geometric_segment_distance.test.cpp
• test/Geometric_segment_intersection.test.cpp
• test/Geometric_tangent_to_circle.test.cpp
• test/GridBFS.test.cpp
• test/HLD_LCA.test.cpp
• test/HLD_edge.test.cpp
• test/HLD_subtree_edge.test.cpp
• test/HLD_vertex.test.cpp
• test/IO_2Dvector_and_Ruby_push_back_Transpose_Map_Sum.test.cpp
• test/IO_vector_and_Ruby_Reverse.test.cpp
• test/Imos.test.cpp
• test/ImosLinear.test.cpp
• test/Input2DVector.test.cpp
• test/Input2DVector_read.test.cpp
• test/Input_Output.test.cpp
• test/Input_column.test.cpp
• test/Inversion.test.cpp
• test/Knapsack.test.cpp
• test/Knapsack01.test.cpp
• test/Kruskal.test.cpp
• test/LCA.test.cpp
• test/LCS.test.cpp
• test/LIS.test.cpp
• test/Levenshtein.test.cpp
• test/MaximumRectangle.test.cpp
• test/Partition.test.cpp
• test/PersistentQueue.test.cpp
• test/PersistentUnionFind.test.cpp
• test/PrimeFactor.test.cpp
• test/QuadraticEquation.test.cpp
• test/RangeAddRangeMin.test.cpp
• test/RangeAddRangeSum.test.cpp
• test/RangeMinQuery.test.cpp
• test/RangeSet.test.cpp
• test/RangeSet2.test.cpp
• test/RangeSumQuery.test.cpp
• test/RangeUpdateRangeMin.test.cpp
• test/RangeUpdateRangeSum.test.cpp
• test/ReRooting.test.cpp
• test/RollingHash.test.cpp
• test/Ruby_Min_Max_Sum.test.cpp
• test/RunLengthEncoding.test.cpp
• test/Sieve.test.cpp
• test/StronglyConnectedComponents.test.cpp
• test/TemplateFunctions.test.cpp
• test/TopologicalSort.test.cpp
• test/TravelingSalesmanProblem.test.cpp
• test/UnionFind.test.cpp
• test/WarashallFloyd.test.cpp
• test/WeightedUnionFind.test..cpp
• test/ZAlgotihm.test.cpp
• test/extGcd.test.cpp
• test/isPrime.test.cpp
• test/modint_pow.test.cpp
• test/template.test.cpp
• test/template_no_Ruby.test.cpp