Pagini recente » Cod sursa (job #2874034) | Cod sursa (job #2059187) | Cod sursa (job #884738) | Cod sursa (job #2399347) | Cod sursa (job #2612081)
#include<cstdio>
#define MAX_N 8
using namespace std;
int st[MAX_N], n;
bool uz[MAX_N+1];
FILE* fout = fopen("permutari.out","w");
void Back(int k) {
if(k == n) {
for(int i = 0; i < n; i++)
fprintf(fout,"%d ",st[i]);
fprintf(fout,"\n");
} else {
for(int i = 1; i <= n; i++)
if(!uz[i]) {
st[k] = i;
uz[i] = true;
Back(k+1);
uz[i] = false;
}
}
}
int main() {
FILE* fin = fopen("permutari.in","r");
fscanf(fin,"%d",&n);
Back(0);
fclose(fin);
fclose(fout);
return 0;
}