d151 - Break Up is Hard to Do (http://140.122.185.166/ZeroJudge/ShowProblem?problemid=d151)

d151.cpp

bool DFS( int now, int cnt ) {
	visit[ now ] = 1;
	bool ret = 0;
	if ( now == tgA )
		ret = BFS( 1 );

	if ( !cnt || ret ) {
		visit[ now ] = 0;
		return ret;
	}
	
	for ( int i = 0; i < 2; ++i ) {
		int next = vertex[ now ][ i ];
		if ( !visit[ next ] && DFS( next, cnt - 1 ) )
			return 1;
	}
	visit[ now ] = 0;
	return 0;
}