Pagini recente » Cod sursa (job #910837) | Cod sursa (job #1666650) | Cod sursa (job #1681894) | Cod sursa (job #899154) | Cod sursa (job #2029404)
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
int n, st[100], y=0, p=0;
int bun(int k)
{
int i, s, s1;
for(i=1;i<k;i++)
{
if(st[i]==st[k])return 0;
s=k-i;
s1=st[k]-st[i];
if(s<0)s=s*(-1);
if(s1<0)s1=s1*(-1);
if(s==s1)return 0;
}
return 1;
}
void afis()
{
int i;
if(y==0)
{
for(i=1;i<=n;i++)
out<<st[i]<<" ";
y++;
}
p++;
}
void bkt()
{
int k=1;
while(k>0)
if(st[k]<n)
{
st[k]++;
if(bun(k))if(k==n)afis();
else k++;
}
else{
st[k]=0;
k--;
}
}
int main()
{
in>>n;
bkt();
out<<'\n'<<p;
return 0;
}