grep+: UVA problems keyword search (v1.1)

grep+ found these files to match your search:

p10511.cpp: //hard, maximum flow, ford-fulkerson, efficiency
p753.cpp: //multiple input, hard, graphs, maximum flow
p11506.cpp: //hard, graphs, max flow, min cut
p563.cpp: //hard, escape problem, maximum flow, graphs, efficiency
p11752.cpp: //medium, math, overflow
p10806.cpp: //hard, graphs, minimum cost maximum flow, min cost max flow
p10480.cpp: //hard, graphs, maximum flow, minimum cut, classic, good
p11594.cpp: //hard, graphs, all pairs maximum flow, max flow, gomory-hu trees
p10594.cpp: //hard, graphs, min cost max flow, minimum cost maximum flow, good
p369.cpp: //easy, pascal's triangle, math, nice overflow trick
p10845.cpp: //hard, ridiculously hard, graphs, maximum flow, backtracking, branch and bound, UNSOLVED: Rodrigo's brute force problem :-0
p10746.cpp: //hard, graphs, weighted matching, maximum weighted bipartite matching, hungarian algorithm, min cost max flow, minimum cost maximum flow, good
p11082.cpp: //medium, graphs, maximum flow, matrix row and column sums, bad, confusing, the problem setter lies
p10330.cpp: //hard, graphs, maximum flow, ford-fulkerson, good
p820.cpp: //hard, graphs, maximum flow, good, excellent
p10779.cpp: //hard, graphs, maximum flow, tricky, good, excellent
p544.cpp: //medium, graphs, one-path maximum flow, modified kruskal
p10092.cpp: //hard, graphs, bipartite matching, maximum flow
p10080.cpp: //hard, graphs, bipartite matching, maximum flow
p10735.cpp: //hard, graphs, euler cycle, maximum flow, classic, good, excellent
p11603.cpp: //hard, graphs, all pairs maximum flow, max flow, mst, minimum spanning tree, bottleneck tree

grep+ searches the database of Valladolid problems that I solved (or tried to). You can give it keywords like "dp", "graphs", "math", "brute force", etc. and it will give you a list of problem numbers that (in my opinion) match the keywords. The database contains 1408 problems.