Pagini recente » Cod sursa (job #1931094) | Cod sursa (job #1629762) | Cod sursa (job #294819) | Cod sursa (job #1259316) | Cod sursa (job #929153)
Cod sursa(job #929153)
#include <cstdio>
using namespace std;
int v[100];
int valid(int k,int n)
{
int i;
for(i=1;i<k;i++)
if(v[k]==v[i])
return 0;
return 1;
}
void back(int k,int n)
{
int i;
if(k-1==n)
{
for(i=1;i<=n;i++)
printf("%d ",v[i]);
printf("\n");
}
else
for(i=1;i<=n;i++)
{
v[k]=i;
if(valid(k,n))
back(k+1,n);
}
}
int main()
{
int n;
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1,n);
return 0;
}