Submission #6953385

---

Source Code Expand

#include <iostream>
#include <cstdlib>
using namespace std;
int a[10];
bool flag[10],le[20],ri[20];

void dfs(int num){
    if(num>8){
        for(int i=1;i<=8;i++){
            for(int j=1;j<=8;j++){
                if (a[i]==j){
                    cout<<"Q";
                }else{
                    cout<<".";
                }
            }
            cout<<endl;
        }
        exit(0);
    }
    if(a[num]!=0){
        dfs(num+1);
}else{
    for(int i=1;i<=8;i++){
        if(!flag[i]&&!le[num+1]&&!ri[num-i+8]){
            a[num]=i;
            flag[i]=true;
            le[num+i]=true;
            ri[num-i+8]=true;
            dfs(num+1);
            a[num]=0;
            flag[i]=false;
            le[num+i]=false;
            ri[num-i+8]=false;

        }
    }
}
}
int main(){
    char temp;
    for (int i=1;i<=8;i++){
        for (int j=1;j<=8;j++){
            cin >> temp;
            if(temp=='Q'){
                a[i]=j;
                if(flag[j]||le[i+j]||ri[i-j+8]){
                    cout<<"No Answer\n";
                    return 0;
                }
                flag[j]=true;
                le[i+j]=true;
                ri[i-j+8]=true;
            }
        }
    }
    dfs(1);
    cout<<"No answer\n";
    return 0;
}

Submission Info

Judge Result