Submission #2225084

---

Source Code Expand

#include<bits/stdc++.h>
 
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
 
using namespace std;
 
char field[10][10];
 
bool rec(int cur,int row,int rdi,int ldi){
  if( cur >= 8 ) {
    rep(i,8) {
      rep(j,8){
        printf("%c",field[i][j]);
      } puts("");
    }
    return true;
  }
  int found = 0;
  rep(y,8) if( field[y][cur] == 'Q' ) ++found;
  if( found >= 2 ) return false;
  int ok = ((1<<8)-1) & (~(row|rdi|ldi));
  while( ok ){
    int use = ok & -ok;
    ok -= use;
    int y = log2(use);
    if( found ) {
      if( field[y][cur] == 'Q' ) {
        return rec(cur+1,row|use,(rdi|use)>>1,(ldi|use)<<1);
      } else continue;
    } else {
      field[y][cur] = 'Q';
      if( rec(cur+1,row|use,(rdi|use)>>1,(ldi|use)<<1) ) return true;
      field[y][cur] = '.';
    }
  }
  return false;
}
 
void compute(){
  if( rec(0,0,0,0) ) return;
  puts("No Answer");
}
 
int main(){
  rep(i,8) rep(j,8) cin >> field[i][j];
 
  compute();
  return 0;
}

Submission Info

Judge Result