Pagini recente » Borderou de evaluare (job #586213) | Borderou de evaluare (job #3001822) | Borderou de evaluare (job #1831200) | Monitorul de evaluare | Cod sursa (job #3367491)
#include <fstream>
using namespace std;
ifstream fin("damesah.in");
ofstream fout("damesah.out");
int n, st[20], cnt;
bool ap[20];
bool dp[40], ds[40];
void backtracking(int top)
{
if(top == n + 1)
{
cnt++;
if(cnt == 1)
{
for(int i = 1; i <= n; i++)
fout << st[i] << " ";
fout << '\n';
}
}
else for(int i = 1; i <= n; i++)
if(ap[i] == 0 && dp[n - top + i] == 0 && ds[i + top - 1] == 0)
{
st[top] = i;
ap[i] = 1;
dp[n - top + i] = 1;
ds[i + top - 1] = 1;
backtracking(top + 1);
ap[i] = 0;
dp[n - top + i] = 0;
ds[i + top - 1] = 0;
}
}
int main()
{
fin >> n;
backtracking(1);
fout << cnt << '\n';
return 0;
}