|  | 
|  | 
| back to board | No subject flow can solve this.
 Edited by author 19.02.2010 16:08
Re: No subject Posted by spiker  21 Jul 2014 16:49How we can solve this using flow? Some hints?Thanks,
 Ostap
Re: No subject OMG! How difficult - flow, it's O(N^3) and lots of code...Let the DFS help you! =)
 | 
 | 
|