Competitive Programming
Liste des exercices
Introduction
Waga : 1.0
Hello World
Waga : 1.0
Ad-hoc - Problem: Tournament adversaries
Waga : 1.0
Graphs - Representation
Waga : 1.0
Graphs - Finding a path
Waga : 1.0
Graphs - Solving a maze
Waga : 1.0
Graphs - Breadth-first search
Waga : 1.0
Graphs - Connected components
Waga : 1.0
Graphs - Problem: Fire!
Waga : 1.0
Graphs - Problem: Cross Bracing
Waga : 1.0
Graphs - Bipartite
Waga : 1.0
Graphs - Topological sort
Waga : 1.0
Graphs - Depth-first search: cycle finding
Waga : 1.0
Graphs - DFS: topological order
Waga : 1.0
Graphs - Strongly connected components
Waga : 1.0
Graphs - Problem: Dominos
Waga : 1.0
Graphs - Dijkstra
Waga : 1.0
Graphs - Maximum flow (Edmonds-Karp)
Waga : 1.0
Graphs - Maximum flow runtime
Waga : 1.0
DP - Introduction
Waga : 1.0
DP - Knapsack
Waga : 1.0
DP - Top down VS Bottom up
Waga : 1.0
DP - State graph
Waga : 1.0
DP - Shortest paths: Acyclic formulation
Waga : 1.0
DP - Knapsack, build the solution
Waga : 1.0
DP - Memory reduction
Waga : 1.0
DP - Knapsack flipping the state formulation
Waga : 1.0
DP - Candy problem, parameter decution
Waga : 1.0
DP - Problem: Copying books
Waga : 1.0
DP - Problem: Knockout Tournament
Waga : 1.0
DP - Problem: Forming Quiz Teams
Waga : 1.0
Binary search - Introduction
Waga : 1.0
Binary search - Square root
Waga : 1.0
Binary search - Search on the answer
Waga : 1.0
Binary Search - Problem: Glyph Recognition
Waga : 1.0
Techniques - Brute force on solution structure
Waga : 1.0
Techniques - Problem: Iron and Coal
Waga : 1.0
Geometry - Cross product
Waga : 1.0
Geometry - Point orientation
Waga : 1.0
Geometry - Point in convex polygon
Waga : 1.0
INGInious