Pagini recente » Cod sursa (job #1898959) | Cod sursa (job #940985) | Borderou de evaluare (job #1569177) | Cod sursa (job #2718675) | Cod sursa (job #232924)
Cod sursa(job #232924)
#include"stdio.h"
int n,st[100];
int ok(int k)
{for(int g=1;g<k;g++)if(st[g]==st[k])return 0;return 1;}
void afis()
{for(int g=1;g<=n;g++)printf("%d ",st[g]);printf("\n");}
void back(int k)
{ if(k>n)afis();
else for(int g=1;g<=n;g++)
{st[k]=g;if(ok(k))back(k+1);}}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}