Submission #1368320

---

Source Code Expand

#include <cstdio>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;

typedef vector<int> vi;

#define MAX_INT 114514

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define ALL(a) (a).begin(),a.end()
#define MAXE(a) *max_element(ALL(a))
#define MINE(a) *min_element(ALL(a))

string s[8];


int check(int x,int y){
	REP(j,8) REP(i,8){
		if(i==x && j==y) continue;
			if(s[j][i] == 'Q'){
				if(j == y) return 0;
				if(i == x) return 0;
				if(abs(i-x) == abs(j-y)) return 0;
			}
	}
	return 1;
}


//n箇所にqを置けるか
int DFS(int n){
	if(n == 0) return 1;
	else{
		REP(y,8) REP(x,8){
			if(s[y][x] != 'Q'){
				if(check(x,y)){
					s[y][x] = 'Q';
					if(DFS(n-1)) return 1;
				}
				s[y][x] = '.';
			}
		}
		return 0;
	}
}

int main(){
	REP(i,8){
		cin >>s[i];
	}

	if(DFS(5)){
		REP(i,8)cout << s[i] << endl;
	}
	else{
		cout << "No Answer" << endl;
	}


}

Submission Info

Judge Result