Pagini recente » Cod sursa (job #1487555) | Cod sursa (job #1084400) | Cod sursa (job #1927567) | Cod sursa (job #2578568) | Cod sursa (job #160424)
Cod sursa(job #160424)
#include <stdio.h>
int st[10],n,used[10];
void back(int k)
{
if(k==n+1)
{
for(int i=1;i<=n;++i) printf("%d ",st[i]);
printf("\n");
}
else
{
for(st[k]=1;st[k]<=n;++st[k])
{
if(used[st[k]]) continue;
used[st[k]]=1;
back(k+1);
used[st[k]]=0;
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
fclose(stdin);
back(1);
fclose(stdout);
return 0;
}