Cod sursa(job #2376977)
| Utilizator | Data | 8 martie 2019 20:31:45 | |
|---|---|---|---|
| Problema | Problema Damelor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("dame.in");
ofstream g("dame.out");
int n, k, x[15], ok, nr;
int cont(int k)
{
for(int i=1; i<k; i++)
if(x[i] == x[k] || k-i == abs(x[i]-x[k])) return 0;
return 1;
}
void afis()
{
if(!ok)
{ for(int i=1; i<=n; i++) g << x[i] << ' ';
g << '\n';
ok = 1;
}
nr++;
}
void Back(int k)
{
for(int i=1; i<=n; i++)
{
x[k] = i;
if(cont(k)) if(k == n) afis();
else Back(k+1);
}
}
int main()
{
f >> n;
Back(1);
g << nr << '\n';
return 0;
}
