Cod sursa(job #1146770)
| Utilizator | Data | 19 martie 2014 11:39:45 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 9
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int a[MAX],b[MAX];
int n;
void afisare()
{
int i;
for(i=1;i<=n;i++)
fout<<a[i]<<" ";
fout<<endl;
}
void bek(int k)
{
if(k==n+1)
{
afisare();
return;
}
int i,j;
for(i=1;i<=n;i++){
if(b[i]==0){
a[k]=i;
b[i]=1;
bek(k+1);
b[i]=0;
}
}
}
int main()
{
fin>>n;
bek(1);
fin.close();
fout.close();
return 0;
}
