Problem D:Gone Fishing Time Limit:1000MS Memory Limit:65536K Total Submit:999 Accepted:366 Language: not limited Descr iption John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <=
Descr iption 附代码 John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake
