ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1176. Hyperchannels

Question (+)
Posted by Roman Lipovsky 1 Nov 2004 21:28
For sample input:

4 2
0 0 1 0
0 0 1 0
1 1 0 1
0 0 1 0

I must find Eulerian cycle for such graph:

0 1 0 1
1 0 0 1
0 0 0 0
1 1 0 0

Is new graph correct or not?

Edited by author 01.11.2004 21:34
Re: Question (+)
Posted by Sergey Baskakov, Raphail and Denis 13 Mar 2005 09:54
What don't you like about it?
I bet, it's OK(!
   rafailka.

Edited by author 13.03.2005 09:56