Pagini recente » Cod sursa (job #1325484) | Cod sursa (job #2445963) | Cod sursa (job #2683553) | Borderou de evaluare (job #1841128) | Cod sursa (job #1111128)
#include<cstdio>
using namespace std;
const int NMAX = 8+2;
int N;
int S[NMAX];
bool Verifica(int top)
{
int i;
for(i=1; i<top; i++)
if(S[i]==S[top]) return 0;
return 1;
}
void Afisare(int top)
{
int i;
for(i=1; i<top; i++)
printf("%d ",S[i]);
printf("\n");
}
void Back(int top)
{
int i;
if(top>N)
{
Afisare(top);
return;
}
for(i=1; i<=N; i++)
{
S[top]=i;
if(Verifica(top)) Back(top+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&N);
Back(1);
return 0;
}