Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/abdeltwabmf/competitive-programming-3

My Solutions to problems in [Competitive Programming 3]
https://github.com/abdeltwabmf/competitive-programming-3

apsp competitive-programming-3 graph graphs-algorithms online-judge pairs-shortest-paths problem-solving-paradigms sssp

Last synced: about 21 hours ago
JSON representation

My Solutions to problems in [Competitive Programming 3]

Host: GitHub
URL: https://github.com/abdeltwabmf/competitive-programming-3
Owner: AbdeltwabMF
License: gpl-3.0
Created: 2020-09-01T02:35:38.000Z (about 4 years ago)
Default Branch: master
Last Pushed: 2021-09-14T21:05:01.000Z (about 3 years ago)
Last Synced: 2023-03-05T05:03:09.951Z (over 1 year ago)
Topics: apsp, competitive-programming-3, graph, graphs-algorithms, online-judge, pairs-shortest-paths, problem-solving-paradigms, sssp
Language: C++
Homepage:
Size: 169 KB
Stars: 0
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        # Competitive-Programming-3

 My Solutions to Problems in [Copetitive Programming 3 By Steven Halim]

## Contents

 2. [Problem Solving Paradigms](2.Problem-Solving-Paradigms)

   - [2.1 Complete Search](2.1.Complete-Search)

     - [2.1.1 Iterative Complete Search](2.1.1.Iterative-Complete-Search)

       - [UVa 725 Division](2.Problem-Solving-Paradigms/2.1.Complete-Search/2.1.1.Iterative-Complete-Search/UVa-725-Division.cpp)

       - [UVa 10125 Sumset](2.Problem-Solving-Paradigms/2.1.Complete-Search/2.1.1.Iterative-Complete-Search/UVa-10125-Sumset.cpp)

---

 4. [Graph](4.Graph)

   - [4.1 Graph Traversal](4.Graph/4.1.Graph-Traversal)

     - [4.1.1 Just Graph Traversal](4.Graph/4.1.Graph-Traversal/4.1.1.Just-Graph-Traversal)

       - [UVa 11902 Dominator](4.Graph/4.1.Graph-Traversal/4.1.1.Just-Graph-Traversal/UVa-11902-Dominator.cpp)

       - [UVa 11902 Dominator [BFS]](4.Graph/4.1.Graph-Traversal/4.1.1.Just-Graph-Traversal/UVa-11902-Dominator[BFS].cpp)

     - [4.1.2 Flood Fill and Finding Connected Components](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components)

       - [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)

       - [UVa 459 Graph Connectivity](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-459-GraphConnectivity.cpp)

       - [UVa 459 Graph Connectivity [BFS]](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-459-Graph-Connectivity[BFS].cpp)

       - [UVa 785 Grid Colouring](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-785-Grid-Colouring.cpp)

       - [UVa 352 The Seasonal War](4.Graph/4.1.Graph-Traversal/4.1.2.FloodFill-Finding-Connected-Components/UVa-352-The-Seasonal-War.cpp)

       - [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)

     - [4.1.3 Topological Sort](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort)

       - [UVa 11686 Pick up sticks](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-11686-Pick-up-sticks.cpp)

       - [UVa 11060 Beverages](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-11060-Beverages.cpp)

       - [UVa 10305 Ordering Tasks](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-10305-Ordering-Tasks.cpp)

       - [UVa 872 Ordering](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-872-Ordering.cpp)

       - [UVa 200 Rare Order](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-200-Rare-Order.cpp)

       - [UVa 124 Following Orders](4.Graph/4.1.Graph-Traversal/4.1.3.Topological-Sort/UVa-124-Following-Orders.cpp)

     - [4.1.4 Bipartite Graph Check](4.Graph/4.1.Graph-Traversal/4.1.4.Bipartite-Graph-Check)

       - [Uva 10505 Montesco vs Capuleto](4.Graph/4.1.Graph-Traversal/4.1.4.Bipartite-Graph-Check/Uva-10505-MontescovsCapuleto.cpp)

       - [UVa 11080 Place the Guards](4.Graph/4.1.Graph-Traversal/4.1.4.Bipartite-Graph-Check/UVa-11080-Place-the-Guards.cpp)

     - [4.1.5 Finding Articulation Points and Bridges](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges)

       - [UVa 315 Network](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-315-Network.cpp)

   	   - [UVa 796 Critical Links](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-796-Critical-Links.cpp)

   	   - [UVa 10199 Tourist Guide](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-10199-Tourist-Guide.cpp)

   	   - [UVa 610 Street Directions](4.Graph/4.1.Graph-Traversal/4.1.5.Finding-Articulation-Points-and-Bridges/UVa-610-Street-Directions.cpp)

   	 - [4.1.6 Finding Strongly Connected Components](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components)

   	   - [UVa 11709 Trust groups](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-11709-Trust-groups.cpp)

   	   - [UVa 11838 Come and Go](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-11838-Come-and-Go.cpp)

   	   - [UVa 11504 Dominos](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-11504-Dominos.cpp)

   	   - [UVa 1229 Sub dictionary](4.Graph/4.1.Graph-Traversal/4.1.6.Finding-Strongly-Connected-Components/UVa-1229-Sub-dictionary.cpp)

   - [4.2 Single-Source Shortest Paths (SSSP)](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP))

     - [4.2.1 Unweighted Graph: BFS](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.1.Unweighted-Graph-BFS)

       - [UVa 821 Page Hopping](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.1.Unweighted-Graph-BFS/UVa-821-Page-Hopping.cpp)

     - [4.2.2 Weighted Graph: Dijkstra](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.2.Weighted-Graph-Dijkstra)

       - [UVa 929 Number Maze](4.Graph/4.2.Single-Source-Shortest-Paths-(SSSP)/4.2.2.Weighted-Graph-Dijkstra/UVa-929-Number-Maze.cpp)

       - [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)

       - [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)

     - [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)

       - [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)

       - [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)

       - [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)

   - [4.3 All-Pairs Shortest Paths (APSP)](4.Graph/4.3.All-Pairs-Shortest-Paths-(APSP))

     - [UVa 821 Page Hopping](4.Graph/4.3.All-Pairs-Shortest-Paths-(APSP)/UVa-821-Page-Hopping.cpp)

     - [UVa 567 Risk](4.Graph/4.3.All-Pairs-Shortest-Paths-(APSP)/UVa-567-Risk.cpp)