Welcome   HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online
Home
FAQs
Problem Set
Practices
Online Contests
Major Exercises
OI Special
Judgement
Submit
Online Status
User Ranklist
Users
Register new
Login
Web Links
Hunan Normal University
College of Information Science and Engineering
Just a game 
Time Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KB
Total submit users: 36, Accepted users: 31
Problem 10884 : No special judgement
Problem description
  During the 40-hours' travel to SCU, AngelClover and Sweetsc are playing the old game: Tic-Tac-ToeThe rule is simple: A 3*3 boardtwo players mark X and O in turn, if one player has marked a row , a column or a diagonal, he will win. AngelClover(X) moves first.

Unfortunately, the game is too simple, AngleClover soon find the key: mark the middle of the board in his first turn. Though the game is too unfair, they will expand the board to 4*4, if a player makes 3 continuous same marks on a row, a column or any diagonal, he will win.

AngelClover and Sweetsc always make the best move.

Input
  A 4*4 Board, _  is a empty position, X means AngelClover's move, O means Sweet's move, and the input is valid.

Output
  Tell us the result of the one who play the next move.
If he can win(or lose) in the end, then output Win(or Lose); otherwise the game will end with a draw then output Draw

Sample Input
__XX
__OO
____
____
Sample Output
Win
Problem Source
  Crazy for Programming' Nankai University Programming Contest VII 

Submit   Discuss   Judge Status  Problems  Ranklist 

HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online, Version 2010.5.5.final.
Web visits:2056 today,12073105 total, since 2010-05-07