code1064 虫食算

#include<iostream>
#include<cstdlib>
#include<cstring>
#define Size 30
using namespace std;

int n;
int cc[3][Size];
int dic[Size]={0,  1,0,3,4,2};
bool vis[Size];

bool row(int i){
    if(dic[cc[0][i]]!=-1&&dic[cc[1][i]]!=-1&&dic[cc[2][i]]!=-1){
        int k=dic[cc[0][i]]+dic[cc[1][i]];
        if(k%n!=dic[cc[2][i]] && (k+1)%n!=dic[cc[2][i]])return false;
    }
    return true;
}

int next(){
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++){
            if(dic[cc[j][i]]==-1)return cc[j][i];
        }
    }
    return n+1;
}

bool check(){
    int dd[3][Size];
    for(int i=0;i<3;i++){
        for(int j=1;j<=n;j++){
            dd[i][j]=dic[cc[i][j]];
        }
    }
    int f[Size];
    memset(f,0,sizeof(f));
    for(int i=1;i<=n;i++){
        f[i]+=dd[0][i];f[i]+=dd[1][i];
        while(f[i]>=n)f[i]-=n,f[i+1]++;
        if(f[i]!=dd[2][i])return false;
    }
    return true;
}

void dfs(int k){
    if(k>n){
        if(check()){
            for(int i=1;i<=n;i++)cout<<dic[i]<<‘ ‘;
            exit(0);
        }
    }
    //jianzhi
    for(int i=1;i<=n;i++){//1
        if(!row(i))return;
    }
    
    for(int i=n-1;i>=0;i--){
        if(!vis[i]){
            dic[k]=i;
            vis[i]=true;
            dfs(next());
            vis[i]=false;
            dic[k]=-1;
        }
    }
}

int main(){
    freopen("1064.in","r",stdin);
    memset(dic,-1,sizeof(dic)); 
    cin>>n;
    char temp[Size];
    for(int i=0;i<3;i++){
        cin>>temp+1;
        for(int j=1;j<=n;j++){
            cc[i][j]=temp[n-j+1]-64;
        }
    }
    dfs(next());
    return 0;
}