Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

每种情况都会有解

Posted by bugthink at 2010-09-24 10:43:31 on Problem 2965 and last updated at 2010-09-24 10:44:55
In Reply To:Re:如果是Impossible的情况这种方法的结果会是什么。。。 Posted by:AngelClover at 2008-05-01 11:40:07
不存在impossbile的情况,呃,按照上面说的方法,是每种情况都有解的。

实际上,如果从数学上证明的话,如果handles[i][j]='+',那么,你可以将ith row
 switch一次,然后,把jth column switch一次。然后,把handles[i][j] switch一
次,就可以将handle[i][j]变为'-',然后,其他的handles的状态不会变化。


以此继续,就可以将所有的handles都变成'-'.

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator