Cod sursa(job #2492972)
| Utilizator | Data | 15 noiembrie 2019 18:41:31 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
#define NMAX 10
using namespace std;
int s[NMAX],n;
bool used[NMAX];
FILE *fin = fopen("permutari.in","r");
FILE *fout = fopen("permutari.out","w");
void tipar()
{
for(int i=1;i<=n;++i)
fprintf(fout,"%d ",s[i]);
fprintf(fout,"\n");
}
void bkt(int k)
{
if(k == n+1)tipar();
else
for(int i=1;i<=n;++i)
if(!used[i])
{
used[i] = 1;
s[k] = i;
bkt(k+1);
used[i] = 0;
}
}
int main()
{
fscanf(fin,"%d",&n);
bkt(1);
}
