{"id":21634784,"url":"https://github.com/glintonliao/competitive-programming","last_synced_at":"2025-03-18T22:41:07.634Z","repository":{"id":120622384,"uuid":"552474358","full_name":"GlintonLiao/competitive-programming","owner":"GlintonLiao","description":"Selected algorithm templates and solutions","archived":false,"fork":false,"pushed_at":"2023-01-04T17:02:43.000Z","size":24,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-25T00:20:00.319Z","etag":null,"topics":["algorithms","competitive-programming","cpp"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GlintonLiao.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-10-16T17:17:54.000Z","updated_at":"2023-03-07T23:37:11.000Z","dependencies_parsed_at":null,"dependency_job_id":"eab3bf28-e1f9-44fb-8922-c653c0c8e5d8","html_url":"https://github.com/GlintonLiao/competitive-programming","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlintonLiao%2Fcompetitive-programming","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlintonLiao%2Fcompetitive-programming/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlintonLiao%2Fcompetitive-programming/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GlintonLiao%2Fcompetitive-programming/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GlintonLiao","download_url":"https://codeload.github.com/GlintonLiao/competitive-programming/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244320322,"owners_count":20434090,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","competitive-programming","cpp"],"created_at":"2024-11-25T03:18:07.985Z","updated_at":"2025-03-18T22:41:07.597Z","avatar_url":"https://github.com/GlintonLiao.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Competitive Programming\nSelected algorithm templates and solutions\n\n```cpp\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n#include \u003ccstring\u003e\n\nusing namespace std;\n\nint main() {\n    return 0;\n}\n```\n\n### Choosing Algorithms Based on Data Scale\n\n1. `n ≤ 30`, DFS + Pruning，BitMask DP\n2. `n ≤ 100` =\u003e `O(n^3)`, floyd，DP，Gaussian Elimination\n3. `n ≤ 1000` =\u003e `O(n2)`, `O(n^2logn)`, DP, BinarySearch，Dijkstra-B, Prim-B, Bellman-Ford\n4. `n ≤ 10000` =\u003e `O(n√n)`，Unrolled Linked List, Block Partition, Mo's Algorithm\n5. `n ≤ 100000` =\u003e `O(nlogn)` =\u003e Sort, Segment Tree, Binary Indexed Tree, Set/Map, Heap, TopoSort, Dijkstra-H, Prim-H, Kruskal, SPFA, Convex Hull, BinarySearch, CDQ, Suffix array, Heavy Path Decomposition, LCT\n6. `n ≤ 1000000` =\u003e `O(n)`, and low constant `O(nlogn)` =\u003e PriorityQueue, Hash, Two Pointers, Union Find, KMP, Aho–Corasick, or Sort、Binary Indexed Tree、Heap、Dijkstra、SPFA\n7. `n ≤ 10000000` =\u003e `O(n)`, Two Pointers、KMP、Aho–Corasick、Sieve Prime\n8. `n ≤ 10^9` =\u003e `O(√n)`，Sieve Prime\n9. `n ≤ 10^18` =\u003e `O(logn)`，GCD, Binary Exponentiation, Decimal DP\n10. `n ≤ 10^1000` =\u003e `O((logn)^2)`, High Precision\n11. `n ≤ 10100000` =\u003e `O(logk×loglogk)`, k means bits, High Precision +/-、FFT/NTT\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglintonliao%2Fcompetitive-programming","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fglintonliao%2Fcompetitive-programming","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fglintonliao%2Fcompetitive-programming/lists"}