Pagini recente » Cod sursa (job #1089706) | Cod sursa (job #2977854) | Cod sursa (job #1762211) | Cod sursa (job #1588314) | Cod sursa (job #1568577)
#include<cstdio>
using namespace std;
int v[9],n;
void bt(int k)
{
for(int i=1; i<=n; i++)
{
v[k]=i;
if(k!=n) bt(k+1);
if(ok()&&k==n) print();
}
}
bool ok()
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) if(i!=j&&v[i]==v[j]) return 0;
return 1;
}
void print()
{
for(int i=0;i<n;i++) printf("%d ",v[i]);
printf("\n");
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
}