A - Tree Summing - 112 
B - Power of Cryptography - 113 
C - Pipe Fitters - 121 
D - ID Codes - 146
E - Evaluating Simple C Expressions - 327 
F - Simple Minded Hashing - 10912 
G - Dijkstra, Dijkstra - 10806 
H - Data Flow - 10594 
I - War - 10158

problemas do UVA Judge Online

Resolvidos:

OK - A - Tree Summing - nike
OK - B - Power of Cryptography - Binary Search + BigInteger
OK - C - Pipe Fitters - nike
OK - D - ID Codes - nike
OK - E - Evaluating Simple C Expressions - nike
OK - F - Simple Minded Hashing - programação dinâmica
OK - G - Dijkstra, Dijkstra - mcmf ( min cost max flow )
OK - H - Data Flow - mcmf ( min cost max flow )
OK - I - War - disjoint set