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 1092. Transversal

Can anybody please tell me how to greedy this prob?
Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 28 Oct 2004 05:04
Well, it's not hard after proving that there's always a solution
Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 28 Oct 2004 15:26
Re: Well, it's not hard after proving that there's always a solution
Posted by Denis Koshman 19 Aug 2008 02:50
Put all + signs onto main diagonal (except for the last row). Then you have to (optionally) flip main diagonal and reduce double + in columns towards single + in the last column.