uva 186 - Trip Routing

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

uva 11517 - Exact Change

/*
Problem link
Type: DP - Coin change
Algorithm:
*/

uva 10313 - Pay the Price

 1 /*
 2  Problem link
 3  Type: DP - coin change
 4  Algorithm:

Red - black tree full implementation

Red-black tree is known for an efficient data structure use in computer science. It is a type of self-balance binary search tree, it performs insertion, deletion, searching,.. in the worst running time of O(lg n). This is my red-black tree implementation in C++:

uva 10009 - All Roads Lead Where?

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

uva 11137 - Ingenuous Cubrency

 1 /*
 2  Problem link
 3  Type: DP
 4  Algorithm: Coin change
 5  */

uva 10306 - e-Coins

 1  /*
 2  Problem link
 3  Type: DP - Coins change
 4  Algorithm:
 5      First I use the function getP to search for a list of possible points with
 6       length = s from the origin and have possitive coordinates.
 7      Use the coins change algorithm (uva 166) with a few changes to find the
 8       minimum step to each point i got. Get the minimum for each point result.
 9  */