Submission #1239620

---

Source Code Expand

A = []
Xlist = [0,1,2,3,4,5,6,7]
Ylist = [0,1,2,3,4,5,6,7]
import copy

def checkQ(x,y):
	for n in range(8):
		if n != x:
			if A[y][n] == 'Q':
				return -1
		if n != y:
			if A[n][x] == 'Q':
				return -1
		if x - y + n >= 0 and x - y + n < 8 and y != n:
			if A[n][x - y + n] == 'Q':
				return -1
		if x + y - n >= 0 and x + y - n < 8 and y != n:
			if A[n][x + y - n] == 'Q' :
				return -1
	return 0

def putQ(x,y):
	A[y][x] = 'Q'
#	for n in range(8):
#		if n != x:
#			A[y][n] = 'x'
#		if n != y:
#			A[n][x] = 'x'
#		if x - y + n >= 0 and x - y + n < 8 and y != n:
#			A[n][x - y + n] = 'x'
#		if x + y - n >= 0 and x + y - n < 8 and y != n:
#			A[n][x + y - n] = 'x'

def iniQ():
	for n in range(8):
		for m in range(8):
			if A[m][n] =='Q':
				if checkQ(n,m):
					return -1
				else:
					putQ(n,m)
					Xlist.remove(n)
					Ylist.remove(m)
	return 0

def printboard():
	for n in range(8):
		print "".join(A[n])

def bfs(n):
	global A
	if n < 5:
		i = n
		while i < 5:
			if checkQ(Xlist[i],Ylist[n]) == 0:
				temp = Xlist[i]
				Xlist[i] = Xlist[n]
				Xlist[n] = temp
				R = copy.deepcopy(A)
				putQ(Xlist[n],Ylist[n])
				if bfs(n+1) == 0:
					return 0
				temp = Xlist[n]
				Xlist[n] = Xlist[i]
				Xlist[i] = temp
				A = copy.deepcopy(R)
			i += 1
		return 1
	else:
		return 0

for n in range(8):
	A.append(list(raw_input()))
if iniQ():
	print 'No Answer'
else:
	bfs(0)
	for n in range(5):
		putQ(Xlist[n],Ylist[n])
	printboard()
		

Submission Info

Judge Result