Cod sursa(job #1329148)
Utilizator | Medvichi Stefan stefan1 | Data | 29 ianuarie 2015 09:26:34 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#define DMAX 10
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n;
int sol[DMAX];
bool uz[DMAX];
void permutari(int k);
int main()
{
fin>>n;
permutari(1);
fout.close();
return 0;
}
void permutari(int k)
{
int i;
if (k==n+1)
{
for (i=1; i<=n; ++i)
fout<<sol[i]<<' ';
fout<<'\n';
return;
}
for (i=1; i<=n; ++i)
if (!uz[i])
{
sol[k]=i; uz[i]=1;
permutari(k+1);
uz[i]=0;
}
}