CodeShelf：XCPC模板的代码架-源码

[{"title":"（34个子文件41KB）CodeShelf：XCPC模板的代码架-源码","children":[{"title":"CodeShelf-main","children":[{"title":"ComputationalGeometry","children":[{"title":"ComputationalGeometry.md <span style='color:#111;'>0B</span>","children":null,"spread":false},{"title":"SolidGeometry_MinimumCoveringBall.cpp <span style='color:#111;'>5.21KB</span>","children":null,"spread":false}],"spread":true},{"title":".gitignore <span style='color:#111;'>388B</span>","children":null,"spread":false},{"title":"MathTheory","children":[{"title":"MathTheory.md <span style='color:#111;'>0B</span>","children":null,"spread":false},{"title":"Prime_eular.cpp <span style='color:#111;'>871B</span>","children":null,"spread":false}],"spread":true},{"title":"Others","children":[{"title":"Others.md <span style='color:#111;'>0B</span>","children":null,"spread":false}],"spread":true},{"title":"String","children":[{"title":"StringCompare_Knuth-Morris-Pratt.cpp <span style='color:#111;'>1.72KB</span>","children":null,"spread":false},{"title":"String.md <span style='color:#111;'>56B</span>","children":null,"spread":false}],"spread":true},{"title":"GraphTheory","children":[{"title":"ShortestPath_BellmanFord_Queue.cpp <span style='color:#111;'>2.63KB</span>","children":null,"spread":false},{"title":"BitpartiteGraph_KuhnMunkres.cpp <span style='color:#111;'>4.84KB</span>","children":null,"spread":false},{"title":"StronglyConnectedComponents_Tarjan.cpp <span style='color:#111;'>2.78KB</span>","children":null,"spread":false},{"title":"NetworkFlow_Dicnic_zyy_nju.cpp <span style='color:#111;'>2.23KB</span>","children":null,"spread":false},{"title":"BitpartiteGraph_Hungarian.cpp <span style='color:#111;'>2.05KB</span>","children":null,"spread":false},{"title":"MinimumSpanningTree_Kruskal.cpp <span style='color:#111;'>318B</span>","children":null,"spread":false},{"title":"ShortestPath_Dijkstra_PriorityQueue.cpp <span style='color:#111;'>2.59KB</span>","children":null,"spread":false},{"title":"NetworkFlow_EdmondsKarp.cpp <span style='color:#111;'>2.43KB</span>","children":null,"spread":false},{"title":"NetworkFlow_ISAP.cpp <span style='color:#111;'>3.19KB</span>","children":null,"spread":false},{"title":"GraphTheory.md <span style='color:#111;'>370B</span>","children":null,"spread":false},{"title":"BitpartiteGraph_HoKashyap.cpp <span style='color:#111;'>3.34KB</span>","children":null,"spread":false},{"title":"WorkOnTree_HeavyLightDecomposition.cpp <span style='color:#111;'>2.99KB</span>","children":null,"spread":false},{"title":"MinimiumSpanningTree_Prim.cpp <span style='color:#111;'>1.57KB</span>","children":null,"spread":false},{"title":"NetworkFlow_Dicnic.cpp <span style='color:#111;'>2.99KB</span>","children":null,"spread":false}],"spread":false},{"title":"AlgorithmIntroduction","children":[{"title":"String","children":[{"title":"PalindromicString_Manacher.md <span style='color:#111;'>1.55KB</span>","children":null,"spread":false}],"spread":true},{"title":"GraphTheory","children":[{"title":"BipartiteGraph.md <span style='color:#111;'>9.00KB</span>","children":null,"spread":false},{"title":"NetworkFlow.md <span style='color:#111;'>12.17KB</span>","children":null,"spread":false},{"title":"MinimumSpanningTree.md <span style='color:#111;'>3.50KB</span>","children":null,"spread":false}],"spread":true},{"title":"DataStructure","children":[{"title":"SegmentTree.md <span style='color:#111;'>4.79KB</span>","children":null,"spread":false}],"spread":true},{"title":"DynamicProgramming","children":[{"title":"DigitDP.md <span style='color:#111;'>4.82KB</span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"README.md <span style='color:#111;'>1.96KB</span>","children":null,"spread":false},{"title":"clear.bat <span style='color:#111;'>130B</span>","children":null,"spread":false},{"title":"DataStructure","children":[{"title":"DataStructure.md <span style='color:#111;'>162B</span>","children":null,"spread":false},{"title":"DisjointUnion_PathZip.cpp <span style='color:#111;'>1.96KB</span>","children":null,"spread":false},{"title":"SegmentTree_PlusMinus.cpp <span style='color:#111;'>3.62KB</span>","children":null,"spread":false},{"title":"SegmentTree_MaxMin.cpp <span style='color:#111;'>5.24KB</span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]