UVA 10092 - The Problem with the Problem Setter

  1  /*
  2  Problem link
  3  Type: Graph - Maximum Flow
  4  Algorithm:

UVa 11747 - Heavy Cycle Edges

  1  /*
  2  Problem type: Graph - MST
  3  Algorithm: Find the Minimum Spanning Tree (MST) (using Kruskal,
  4      Prim) and print out all the edges which are not included in the MST.
  5  */

UVa 10020 - Minimal coverage

  1 /*
  2  Problem link
  3  Type: Greedy - INTERVAL COVERING
  4  Algorithm:

UVa 11565 - Simple Equations

 1  /*
 2  Problem link
 3  Type: Complete Search
 4  Algorithm:

UVa 154 - Recycling

 1  /*
 2  Problem link
 3  Type: Complete search
 4  Algorithm:

uva 681 - Convex Hull Finding

  1  /*
  2  Problem link
  3  Type: Geometry
  4  Algorithm: Graham's Scan

uva 12086 - Potentiometers

 1  /*
 2  Problem link
 3  Type: Data structure - BIT
 4  Algorithm:

uva 12532 - Interval Product

  1  /*
  2  Problem link
  3  Type: Data structure - Binary index (Fenwick) tree
  4  Algorithm:

uva 11988 - Broken Keyboard (a.k.a. Beiju Text)

  1 /*
  2  Problem link
  3  Type: Data structure - link list
  4  Algorithm:

uva 450 - Little Black Book

  1  /*
  2  Problem link
  3  Type: Adhoc - Sorting
  4  Algorithm:

uva 410 - Station Balance

  1 /*
  2  Problem link
  3  Type: Recursion - Greedy
  4  Algorithm:

uva 10171 - Meeting Prof. Miguel...

  1  /*
  2  Problem link
  3  Type: Graph - Floyd
  4  Algorithm:

uva 572 - Oil Deposits

 1  /*
 2  Problem link
 3  Type: Graph
 4  Algorithm: DFS
 5  */

uva 11733 - Airports

 1 /*
 2  Problem link
 3  Type: Graph
 4  Algorithm:
 5      Kruskal, stop when the number of edge selected is equal to n-1 or the price of the edge
 6      equal to the cost to build an airport.
 7  */

uva 311 - Packets

  1  /*
  2  Problem link
  3  Type: Ad hoc, Greedy
  4  Algorithm: