Pagini recente » Cod sursa (job #3211074) | Cod sursa (job #2244059) | Cod sursa (job #1611586) | Cod sursa (job #2154587) | Cod sursa (job #2110435)
#include <fstream>
using namespace std;
ifstream fi("damesah.in");
ofstream fo("damesah.out");
int n;
int a[14][14];
int solutii;
void afisarecoloane(){
for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(a[i][j]==1) fo<<j<<" ";}
void afisare(){
for(int i=1;i<=n;i++){for(int j=1;j<=n;j++) fo<<a[i][j]<<" ";fo<<'\n'; }
fo<<'\n';
}
bool valid(int x, int y){
for(int i=1;i<=n;i++) if(a[x][i]==1 or a[i][y]==1) return 0;
int i,j;
i=x;j=y;
while(i>=1 and j>=1 and i<=n and j<=n){
i+=1;
j+=1;
if(a[i][j]==1) return 0;
}
i=x;j=y;
while(i>=1 and j>=1 and i<=n and j<=n){
i+=1;
j-=1;
if(a[i][j]==1) return 0;
}
i=x;j=y;
while(i>=1 and j>=1 and i<=n and j<=n){
i-=1;
j-=1;
if(a[i][j]==1) return 0;
}
i=x;j=y;
while(i>=1 and j>=1 and i<=n and j<=n){
i-=1;
j+=1;
if(a[i][j]==1) return 0;
}
return 1;
}
void BK(int x,int dame){
for(int y=1;y<=n;y++)
if(valid(x,y)){
a[x][y]=1;
//fo<<x<<" "<<y<<'\n';
//fo<<dame<<" dame"<<'\n';
//afisare();
if(dame==n) {solutii++;
if(solutii==1) afisarecoloane();
//fo<<"gasit"<<'\n';afisare();
}
BK(x+1,dame+1);
a[x][y]=0;
}
}
int main()
{
fi>>n;
BK(1,1);
fo<<'\n';
fo<<solutii;
return 0;
}