Pagini recente » Cod sursa (job #2368311) | Cod sursa (job #658281) | Cod sursa (job #618043) | Cod sursa (job #2336122) | Cod sursa (job #2023424)
#include <bits/stdc++.h>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
int c[14], d1[14], d2[14];
int cnt,n ;
void solve( int y )
{
if ( y == n )
{
cnt ++;
return;
}
for (int x=0; x<n; x++)
{
if( c[x] || d1[x+y] || d2[x-y+n+1] ) continue;
c[x] = d1[x+y] = d2[x-y+n+1]=1;
solve(y+1);
c[x] = d1[x+y] = d2[x-y+n+1]=0;
}
}
int main()
{
in >> n;
solve(0);
out << cnt;
return 0;
}