{"id":18823829,"url":"https://github.com/abdeltwabmf/competitive-programming-3","last_synced_at":"2026-01-19T15:30:17.999Z","repository":{"id":55504136,"uuid":"291876747","full_name":"AbdeltwabMF/competitive-programming-3","owner":"AbdeltwabMF","description":"My Solutions to problems in [Competitive Programming 3]","archived":false,"fork":false,"pushed_at":"2021-09-14T21:05:01.000Z","size":173,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-12-30T04:26:01.455Z","etag":null,"topics":["apsp","competitive-programming-3","graph","graphs-algorithms","online-judge","pairs-shortest-paths","problem-solving-paradigms","sssp"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AbdeltwabMF.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-09-01T02:35:38.000Z","updated_at":"2021-11-02T23:41:40.000Z","dependencies_parsed_at":"2022-08-15T02:00:26.970Z","dependency_job_id":null,"html_url":"https://github.com/AbdeltwabMF/competitive-programming-3","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/AbdeltwabMF%2Fcompetitive-programming-3","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbdeltwabMF%2Fcompetitive-programming-3/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbdeltwabMF%2Fcompetitive-programming-3/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbdeltwabMF%2Fcompetitive-programming-3/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AbdeltwabMF","download_url":"https://codeload.github.com/AbdeltwabMF/competitive-programming-3/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239760213,"owners_count":19692274,"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":["apsp","competitive-programming-3","graph","graphs-algorithms","online-judge","pairs-shortest-paths","problem-solving-paradigms","sssp"],"created_at":"2024-11-08T00:54:48.093Z","updated_at":"2026-01-19T15:30:17.940Z","avatar_url":"https://github.com/AbdeltwabMF.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Competitive-Programming-3\n My Solutions to Problems in [Copetitive Programming 3 By Steven Halim]\n\n## Contents\n\n 2. [Problem Solving Paradigms](2.Problem-Solving-Paradigms)\n   - [2.1 Complete Search](2.1.Complete-Search)\n     - [2.1.1 Iterative Complete Search](2.1.1.Iterative-Complete-Search)\n       - [UVa 725 Division](2.Problem-Solving-Paradigms/2.1.Complete-Search/2.1.1.Iterative-Complete-Search/UVa-725-Division.cpp)\n       - [UVa 10125 Sumset](2.Problem-Solving-Paradigms/2.1.Complete-Search/2.1.1.Iterative-Complete-Search/UVa-10125-Sumset.cpp)\n\n---\n\n 4. [Graph](4.Graph)\n   - [4.1 Graph Traversal](4.Graph/4.1.Graph-Traversal)\n     - [4.1.1 Just Graph Traversal](4.Graph/4.1.Graph-Traversal/4.1.1.Just-Graph-Traversal)\n       - [UVa 11902 Dominator](4.Graph/4.1.Graph-Traversal/4.1.1.Just-Graph-Traversal/UVa-11902-Dominator.cpp)\n       - [UVa 11902 Dominator [BFS]](4.Graph/4.1.Graph-Traversal/4.1.1.Just-Graph-Traversal/UVa-11902-Dominator[BFS].cpp)\n     - [4.1.2 Flood Fill and Finding Connected Components](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components)\n       - [UVa 1103 Ancient Messages (World Final 2011)](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-1103-Ancient-Messages[ICPC'11].cpp)\n       - [UVa 459 Graph Connectivity](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-459-GraphConnectivity.cpp)\n       - [UVa 459 Graph Connectivity [BFS]](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-459-Graph-Connectivity[BFS].cpp)\n       - [UVa 785 Grid Colouring](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-785-Grid-Colouring.cpp)\n       - [UVa 352 The Seasonal War](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-352-The-Seasonal-War.cpp)\n       - [UVa 260 Il Gioco dell'X](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-260-Il-Gioco-dell'X.cpp)\n     - [4.1.3 Topological Sort](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort)\n       - [UVa 11686 Pick up sticks](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-11686-Pick-up-sticks.cpp)\n       - [UVa 11060 Beverages](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-11060-Beverages.cpp)\n       - [UVa 10305 Ordering Tasks](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-10305-Ordering-Tasks.cpp)\n       - [UVa 872 Ordering](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-872-Ordering.cpp)\n       - [UVa 200 Rare Order](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-200-Rare-Order.cpp)\n       - [UVa 124 Following Orders](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-124-Following-Orders.cpp)\n     - [4.1.4 Bipartite Graph Check](4.Graph/4.1.Graph-Traversal/4.1.4.Bipartite-Graph-Check)\n       - [Uva 10505 Montesco vs Capuleto](4.Graph/4.1.Graph-Traversal/4.1.4.Bipartite-Graph-Check/Uva-10505-MontescovsCapuleto.cpp)\n       - [UVa 11080 Place the Guards](4.Graph/4.1.Graph-Traversal/4.1.4.Bipartite-Graph-Check/UVa-11080-Place-the-Guards.cpp)\n     - [4.1.5 Finding Articulation Points and Bridges](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges)\n       - [UVa 315 Network](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-315-Network.cpp)\n   \t   - [UVa 796 Critical Links](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-796-Critical-Links.cpp)\n   \t   - [UVa 10199 Tourist Guide](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-10199-Tourist-Guide.cpp)\n   \t   - [UVa 610 Street Directions](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-610-Street-Directions.cpp)\n   \t - [4.1.6 Finding Strongly Connected Components](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components)\n   \t   - [UVa 11709 Trust groups](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-11709-Trust-groups.cpp)\n   \t   - [UVa 11838 Come and Go](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-11838-Come-and-Go.cpp)\n   \t   - [UVa 11504 Dominos](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-11504-Dominos.cpp)\n   \t   - [UVa 1229 Sub dictionary](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-1229-Sub-dictionary.cpp)\n   - [4.2 Single-Source Shortest Paths (SSSP)](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP))\n     - [4.2.1 Unweighted Graph: BFS](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.1.Unweighted-Graph-BFS)\n       - [UVa 821 Page Hopping](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.1.Unweighted-Graph-BFS/UVa-821-Page-Hopping.cpp)\n     - [4.2.2 Weighted Graph: Dijkstra](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.2.Weighted-Graph-Dijkstra)\n       - [UVa 929 Number Maze](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.2.Weighted-Graph-Dijkstra/UVa-929-Number-Maze.cpp)\n       - [UVa 10801 Lift Hopping](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.2.Weighted-Graph-Dijkstra/UVa-10801-Lift-Hopping[Dijkstra-MPSP].cpp)\n       - [UVa 1112 Mice and Maze](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.2.Weighted-Graph-Dijkstra/UVa-1112-Mice-and-Maze.cpp)\n     - [4.2.3 Weighted Graph with Negative Weight Cycle: Bellman-Ford](4-Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.3.Weighted-Graph-with-Negative-Weight-Cycle-Bellman-Ford)\n       - [UVa 558 Wormholes](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.3.Weighted-Graph-with-Negative-Weight-Cycle-Bellman-Ford/UVa-558-Wormholes.cpp)\n       - [UVa 10557 XYZZY (SPFA)](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.3.Weighted-Graph-with-Negative-Weight-Cycle-Bellman-Ford/UVa-10557-XYZZY[SPFA].cpp)\n       - [UVa 10557 XYZZY (Bellman-Ford)](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.3.Weighted-Graph-with-Negative-Weight-Cycle-Bellman-Ford/UVa-10557-XYZZY[Bellman-Ford].cpp)\n\n   - [4.3 All-Pairs Shortest Paths (APSP)](4.Graph/4.3.All-Pairs-Shortest-Paths-(APSP))\n     - [UVa 821 Page Hopping](4.Graph/4.3.All-Pairs-Shortest-Paths-(APSP)/UVa-821-Page-Hopping.cpp)\n     - [UVa 567 Risk](4.Graph/4.3.All-Pairs-Shortest-Paths-(APSP)/UVa-567-Risk.cpp)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabdeltwabmf%2Fcompetitive-programming-3","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabdeltwabmf%2Fcompetitive-programming-3","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabdeltwabmf%2Fcompetitive-programming-3/lists"}