petya unexperienced programming contestant recently come follow problemyou give nondirected graph consist n node m edge your task determine graph contain hamiltonian pathPetya write quick bugfree code believe solve problem after Petya decide problem April Fools Day contest unfortunately Petya mistake possible algorithm wrong but is not good excuse leave contest submit problem