Procon-Library:用于编程竞赛的 C++ 库

上传者: 42133861 | 上传时间: 2022-10-03 17:32:32 | 文件大小: 535KB | 文件类型: ZIP
C++
普罗康图书馆 这是用于编程竞赛的 C++ 库(topcoder、codeforces、ICPC、Atcoder) 测试 $ make

文件下载

资源详情

[{"title":"( 87 个子文件 535KB ) Procon-Library:用于编程竞赛的 C++ 库","children":[{"title":"Procon-Library-master","children":[{"title":"gtest","children":[{"title":"gtest-all.cc <span style='color:#111;'> 346.05KB </span>","children":null,"spread":false},{"title":"gtest_main.cc <span style='color:#111;'> 1.72KB </span>","children":null,"spread":false},{"title":"gtest.h <span style='color:#111;'> 811.10KB </span>","children":null,"spread":false}],"spread":true},{"title":"graph","children":[{"title":"maximum_flow.cpp <span style='color:#111;'> 4.88KB </span>","children":null,"spread":false},{"title":"minimum_steiner_tree.cpp <span style='color:#111;'> 1.51KB </span>","children":null,"spread":false},{"title":"maximum_independent_set.cpp <span style='color:#111;'> 2.11KB </span>","children":null,"spread":false},{"title":"shortest_path.cpp <span style='color:#111;'> 2.22KB </span>","children":null,"spread":false},{"title":"online_topological_sort.cpp <span style='color:#111;'> 2.81KB </span>","children":null,"spread":false},{"title":"bipartite_matching.cpp <span style='color:#111;'> 1.24KB </span>","children":null,"spread":false},{"title":"2sat.cpp <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false},{"title":"min_cost_flow.cpp <span style='color:#111;'> 6.37KB </span>","children":null,"spread":false},{"title":"hopcraft_karp.cpp <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"minimum_dominating_set.cpp <span style='color:#111;'> 2.25KB </span>","children":null,"spread":false},{"title":"articulation_point.cpp <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"shortest_path_test.cpp <span style='color:#111;'> 1.98KB </span>","children":null,"spread":false},{"title":"lca.cpp <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"strongly_connected_component.cpp <span style='color:#111;'> 2.01KB </span>","children":null,"spread":false},{"title":"minimum_optimum_branching.cpp <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false},{"title":"topological_sort.cpp <span style='color:#111;'> 621B </span>","children":null,"spread":false},{"title":"strongly_connected_component_test.cpp <span style='color:#111;'> 2.75KB </span>","children":null,"spread":false}],"spread":false},{"title":"others","children":[{"title":"bit.cpp <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false},{"title":"date_test.cpp <span style='color:#111;'> 169B </span>","children":null,"spread":false},{"title":"dice.cpp <span style='color:#111;'> 1.11KB </span>","children":null,"spread":false},{"title":"date.cpp <span style='color:#111;'> 298B </span>","children":null,"spread":false}],"spread":true},{"title":"dynamic_programming","children":[{"title":"edit_distance.cpp <span style='color:#111;'> 1.57KB </span>","children":null,"spread":false},{"title":"longest_common_subsequence.cpp <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"knapsack_approximation.cpp <span style='color:#111;'> 2.11KB </span>","children":null,"spread":false}],"spread":true},{"title":"document","children":[{"title":"library.tex <span style='color:#111;'> 10.47KB </span>","children":null,"spread":false},{"title":"library.pdf <span style='color:#111;'> 262.73KB </span>","children":null,"spread":false}],"spread":true},{"title":"common","children":[{"title":"graph_flow.h <span style='color:#111;'> 94B </span>","children":null,"spread":false},{"title":"graph.h <span style='color:#111;'> 120B </span>","children":null,"spread":false},{"title":"common.h <span style='color:#111;'> 234B </span>","children":null,"spread":false},{"title":"xmodmap <span style='color:#111;'> 121B </span>","children":null,"spread":false},{"title":"graph_weight.h <span style='color:#111;'> 169B </span>","children":null,"spread":false},{"title":"vimrc <span style='color:#111;'> 253B </span>","children":null,"spread":false},{"title":"stdc++.h <span style='color:#111;'> 1.65KB </span>","children":null,"spread":false}],"spread":true},{"title":"library.md <span style='color:#111;'> 977B </span>","children":null,"spread":false},{"title":"geometry","children":[{"title":"line.cpp <span style='color:#111;'> 2.95KB </span>","children":null,"spread":false},{"title":"circle.cpp <span style='color:#111;'> 4.07KB </span>","children":null,"spread":false},{"title":"3dgeometory.cpp <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false},{"title":"point.cpp <span style='color:#111;'> 1.14KB </span>","children":null,"spread":false},{"title":"circle_tangent.cpp <span style='color:#111;'> 1.80KB </span>","children":null,"spread":false},{"title":"segment_arrangement.cpp <span style='color:#111;'> 2.12KB </span>","children":null,"spread":false},{"title":"triangle.cpp <span style='color:#111;'> 216B </span>","children":null,"spread":false},{"title":"convex.cpp <span style='color:#111;'> 1.45KB </span>","children":null,"spread":false},{"title":"smallest_circle.cpp <span style='color:#111;'> 585B </span>","children":null,"spread":false},{"title":"polygon.cpp <span style='color:#111;'> 897B </span>","children":null,"spread":false}],"spread":true},{"title":"math","children":[{"title":"optimization.cpp <span style='color:#111;'> 719B </span>","children":null,"spread":false},{"title":"mod_class.cpp <span style='color:#111;'> 2.27KB </span>","children":null,"spread":false},{"title":"equation.cpp <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"simpson.cpp <span style='color:#111;'> 436B </span>","children":null,"spread":false},{"title":"z_transform.cpp <span style='color:#111;'> 504B </span>","children":null,"spread":false},{"title":"prime.cpp <span style='color:#111;'> 2.40KB </span>","children":null,"spread":false},{"title":"combination.cpp <span style='color:#111;'> 1.76KB </span>","children":null,"spread":false},{"title":"mod.cpp <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"matrix.cpp <span style='color:#111;'> 655B </span>","children":null,"spread":false},{"title":"rational.cpp <span style='color:#111;'> 1.12KB </span>","children":null,"spread":false},{"title":"gauss_jordan_elimination.cpp <span style='color:#111;'> 2.41KB </span>","children":null,"spread":false},{"title":"givens_elimination.cpp <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"euclid.cpp <span style='color:#111;'> 379B </span>","children":null,"spread":false},{"title":"simpson_test.cpp <span style='color:#111;'> 248B </span>","children":null,"spread":false}],"spread":false},{"title":".gitignore <span style='color:#111;'> 60B </span>","children":null,"spread":false},{"title":"run <span style='color:#111;'> 191B </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 448B </span>","children":null,"spread":false},{"title":"string","children":[{"title":"SAIS.cpp <span style='color:#111;'> 4.24KB </span>","children":null,"spread":false},{"title":"z_algorithm.cpp <span style='color:#111;'> 731B </span>","children":null,"spread":false},{"title":"suffix_array.cpp <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"suffix_array_test.cpp <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false},{"title":"aho_corasick.cpp <span style='color:#111;'> 2.77KB </span>","children":null,"spread":false},{"title":"trie.cpp <span style='color:#111;'> 391B </span>","children":null,"spread":false},{"title":"trie_test.cpp <span style='color:#111;'> 305B </span>","children":null,"spread":false},{"title":"rolling_hash.cpp <span style='color:#111;'> 1.77KB </span>","children":null,"spread":false}],"spread":true},{"title":"README.md <span style='color:#111;'> 126B </span>","children":null,"spread":false},{"title":"utils","children":[{"title":"cycle_detection_test.cpp <span style='color:#111;'> 762B </span>","children":null,"spread":false},{"title":"cumsum.cpp <span style='color:#111;'> 502B </span>","children":null,"spread":false},{"title":"grid.cpp <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false},{"title":"cycle_detection.cpp <span style='color:#111;'> 735B </span>","children":null,"spread":false},{"title":"compress.cpp <span style='color:#111;'> 516B </span>","children":null,"spread":false}],"spread":true},{"title":"data_structure","children":[{"title":"sparse_table_test.cpp <span style='color:#111;'> 1.92KB </span>","children":null,"spread":false},{"title":"BIT_test.cpp <span style='color:#111;'> 3.37KB </span>","children":null,"spread":false},{"title":"BIT.cpp <span style='color:#111;'> 3.30KB </span>","children":null,"spread":false},{"title":"lower_envelope.cpp <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"union_find.cpp <span style='color:#111;'> 1.57KB </span>","children":null,"spread":false},{"title":"heap","children":[{"title":"skew_heap.cpp <span style='color:#111;'> 824B </span>","children":null,"spread":false}],"spread":false},{"title":"treap.cpp <span style='color:#111;'> 2.39KB </span>","children":null,"spread":false},{"title":"sparse_table.cpp <span style='color:#111;'> 1.18KB </span>","children":null,"spread":false},{"title":"union_find_test.cpp <span style='color:#111;'> 716B </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明