Submission #1241376

---

Source Code Expand

from copy import deepcopy

c = []
for i in range(8):
	c.append(list(input()))

def solve(c):
	def check(c,x,y):
		for i in range(y):
			if c[x][i]=="Q":
				return(False)
		for i in range(y+1,8):
			if c[x][i]=="Q":
				return(False)
		for i in range(x):
			if c[i][y]=="Q":
				return(False)
		for i in range(x+1,8):
			if c[i][y]=="Q":
				return(False)
		for i in range(1,min(x,y)):
			if c[x-i][y-i]=="Q":
				return(False)
		for i in range(1,min(8-x,8-y)):
			if c[x+i][y+i]=="Q":
				return(False)
		for i in range(1,min(x,8-y)):
			if c[x-i][y+i]=="Q":
				return(False)
		for i in range(1,min(8-x,y)):
			if c[x+i][y-i]=="Q":
				return(False)

		return(True)

	for i in range(8):
		for j in range(8):
			if c[i][j] == "Q":
				if not check(c,i,j):
					return("No Answer")

	def foo(c,n):
		if n == 8:
			return(c)
		else:
			for i in range(8):
				for j in range(8):
					if c[i][j] != "Q":
						if check(c,i,j):
							c_ = deepcopy(c)
							c_[i][j] = "Q"
							res = foo(c_, n+1)
							if res is not False:
								return(res)

		return(False)

	res = foo(c,3)
	if res is False:
		return("No Answer")
	else:
		s = ""
		for i in res:
			s += "".join(i)+"\n"
		return(s)

print(solve(c))

Submission Info

Judge Result