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

1次AC了,说说如何判断。

Posted by fengyu05 at 2007-05-20 16:54:47 on Problem 3075
记 X的数量 xs, O的数量 os。
满盘(xs+oy==9)为 full, X胜利为xw,O胜利为ow

1. xs>os+1||xs<os    =>invalid
2. xw&&ow            =>invalid
3. !xw&&!ow&&!full   =>invalid //这点得注意,意思是当盘没满,但双方都没赢
4. ow&&xs==os+1      =>invalid //这点也要注意,意思是O胜利了,但X的数量比O多
5. else              =>valid

祝大家一次AC ^^

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