Pagini recente » Cod sursa (job #174178) | Cod sursa (job #2844172) | Cod sursa (job #2788441) | Cod sursa (job #1165207) | Cod sursa (job #583128)
Cod sursa(job #583128)
#include <stdio.h>
#define maxn 10
int x[maxn], N, used[maxn];
FILE *fin, *fout;
void back(int k)
{
if (k==N+1)
{
for (int j=1; j<=N; j++)
fprintf(fout, "%d ", x[j]);
fprintf(fout, "\n");
return;
}
for (int i=1; i<=N; i++)
if (!used[i])
{
x[k]=i, used[i] = 1;
back(k+1);
used[i] = 0;
}
}
int main()
{
fin = fopen("permutari.in", "rt");
fout = fopen("permutari.out", "wt");
fscanf(fin, "%d", &N);
back(1);
fclose(fin), fclose(fout);
return 0;
}