Pagini recente » Cod sursa (job #1293381) | Cod sursa (job #2782414) | Istoria paginii runda/ignore_plz/clasament | Cod sursa (job #1580569) | Cod sursa (job #1497504)
#include<stdio.h>
FILE *fin,*fout;
int n;
int a[9];
bool b[9];
void afis()
{
for(int i=1;i<=n;i++)
{
fprintf(fout,"%d ",a[i]);
}
fprintf(fout,"\n");
}
void sol(int p)
{
if(p>n)
{
afis();
}
else
{
for(int i=1;i<=n;i++)
{
if(b[i]==0)
{
a[p]=i;
b[i]=1;
sol(p+1);
b[i]=0;
}
}
}
}
int main()
{
fin=fopen("permutari.in","r");
fout=fopen("permutari.out","w");
fscanf(fin,"%d",&n);
sol(1);
}