Pagini recente » Rating vladimir manescu (vlad7654) | Junior Challenge 2016 Runda 2 | Cod sursa (job #2197175) | Statisticile problemei Manhattan | Cod sursa (job #880802)
Cod sursa(job #880802)
#include <stdio.h>
FILE *in,*out;
using namespace std;
int st[9],n;
void tipar(int k)
{
int i;
for (i=1;i<=k;i++)
fprintf(out,"%d ",st[i]);
fprintf(out,"\n");
}
int validare(int k)
{
int ok=1;
int i;
for (i=1;i<k;i++)
if (st[k]==st[i])
ok=0;
return ok;
}
void back(int k)
{
int i;
for (i=1;i<=n;i++)
{
st[k]=i;
if (validare(k))
if (k==n)
tipar(k);
else
back(k+1);
}
}
int main()
{
in=fopen("permutari.in","rt");
out=fopen("permutari.out","wt");
fscanf(in,"%d",&n);
back(1);
fclose(in);
fclose(out);
return 0;
}