Cod sursa(job #3335057)
| Utilizator | Data | 21 ianuarie 2026 15:32:51 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 80 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <stdlib.h>
#define MAXN 8
int v[MAXN],f[MAXN],n;
FILE*fin;
FILE*fout;
void back(int d){
int i,j;
if(d == n){
for(i = 0; i < n;i++)
fprintf(fout,"%d ",v[i]);
fprintf(fout,"\n");
}
else for(i = 1; i <= n;i++){
if(f[i] == 0){
v[d] = f[i] = i;
back(d+1);
f[i] = 0;
}
//V[d] = 0;
}
}
int main()
{
fin = fopen("permutari.in","r");
fout = fopen("permutari.out","w");
fscanf(fin,"%d",&n);
back(0);
return 0;
}
