Cod sursa(job #254808)
Utilizator | Data | 7 februarie 2009 17:06:11 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<stdio.h>
#define N 10
int n,sol[N];
bool oc[N];
void citire()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
}
void afis()
{
for (int i=1; i<=n; ++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if (k==n+1)
{
afis();
return;
}
for (int i=1; i<=n; ++i)
{
if (!oc[i])
{
oc[i]=true;
sol[k]=i;
back(k+1);
oc[i]=false;
}
}
}
int main()
{
citire();
back(1);
return 0;
}