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 1320. Graph Decomposition

test ?
Posted by Nguyễn Cảnh Toàn 4 Jan 2009 08:26
1 2
2 3
3 1
1 10
in this test , i do not know why ?
what about the others vertex ? 4,5,6,7,8,9 ??
Re: test ?
Posted by lian lian 4 Jan 2009 15:41
"Imagine graph drawn on a wall. Select any vertex and erase exactly two edges incidental to this vertex. The question of problem is: "Is it possible to erase all edges of graph doing in this way?""

think again:
1 2
2 3
3 1
1 10

you will understand....