Pagini recente » Cod sursa (job #1891053) | Cod sursa (job #1294109) | Cod sursa (job #2074181) | Cod sursa (job #1503192) | Cod sursa (job #2705568)
#include <fstream>
using namespace std;
int n, nrsolutii = 0;
int reg[20];
bool p[20], ok;
bool OK(int k) {
int i;
for (i = 1; i < k; i++)
if (abs(reg[k] - reg[i]) == k - i)
return 0;
return 1;
}
ofstream g("damesah.out");
void afiseaza() {
int i;
if (!ok) {
for (i = 1; i <= n; i++)
g << reg[i] << ' ';
g << '\n';
}
ok = 1;
nrsolutii++;
}
void back(int k) {
int i;
if (k == n + 1)
afiseaza();
else
for (i = 1; i <= n; i++)
if (!p[i]) {
p[i] = 1;
reg[k] = i;
if (OK(k))
back(k + 1);
p[i] = 0;
}
}
int main() {
ifstream f("damesah.in");
f >> n;
f.close();
back(1);
g << nrsolutii;
g.close();
return 0;
}