grep+ found these files to match your search:
p10543.cpp: // medium, graphs, all-pairs shortest path, floyd-warshall, adjacency matrix powers p523.cpp: //multiple input, hard, graphs, all pairs shortest path, floyd-warshall with path recovery, good p10354.cpp: //medium, graphs, shortest path, floyd-warshall, all vertices belonging to any shortest path, good, excellent p925.cpp: //medium, graphs, transitive closure, floyd-warshall, greedy, sorting, stl, good p10731.cpp: //medium, graphs, simulation, sorting, floyd-warshall, transitive closure, UNSOLVED: WA. I hate Gordon's problems. What the fuck does he want?! p11060.cpp: //medium, graphs, transitive closure, floyd-warshall, sorting, tricky, good, excellent p10113.cpp: //medium, graphs, math, number theory, reachability, floyd-warshall, gcd, rational p10075.cpp: //medium, graphs, geometry, all-pairs shortest path, floyd-warshall, geodesic distance, great circle, good p10803.cpp: //easy, graphs, all-pairs shortest path, floyd-warshall p627.cpp: //medium, graphs, shortest path, floyd-warshall, bfs p280.cpp: //easy, graphs, floyd-warshall, bfs, dfs p10009.cpp: //multiple input, medium, graphs, shortest path, floyd-warshall, careful reading, good p10331.cpp: //medium, graphs, all-pairs shortest path, floyd-warshall p685.cpp: //medium, graphs, weird all-pairs shortest path, edge-graph, floyd-warshall p821.cpp: //medium, graphs, shortest path, floyd-warshall p334.cpp: //medium, graphs, transitive closure, floyd-warshall, bad p10793.cpp: //medium, graphs, all-pairs shortest path, floyd-warshall p247.cpp: //medium, graphs, scc, strongly connected components, floyd-warshall, transitive closure p11047.cpp: //medium, graphs, all-pairs shortest path, floyd-warshall, path recovery, input, getline, bad p567.cpp: //easy, shortest path, floyd-warshall, graphs, all pairs shortest path, unweighted p125.cpp: //hard, graphs, bfs, floyd-warshall, number of paths, good, excellent p10305.cpp: //medium, sorting, transitive closure, floyd-warshall, dag ordering, dag sorting p869.cpp: //easy, graphs, connectivity, floyd-warshall, transitive closure p10724.cpp: //medium, graphs, all-pairs shortest path, floyd-warshall, good, excellent
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.
Please ignore anything that appears after "UNSOLVED:". As you probably know, not being able to solve a problem after many attempts can be very frustrating.