Cod sursa(job #1641408)
| Utilizator | Data | 8 martie 2016 22:57:54 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,p[40],uz[40];
void afisare()
{for(int i=1;i<=n;i++)fout<<p[i]<<" ";
fout<<"\n";
}
void genpermutari(int k)
{if(k-1==n)afisare();
else for(int i=1;i<=n;i++)
if(!uz[i]){p[k]=i;uz[i]=1;
genpermutari(k+1);
uz[i]=0;}
}
int main()
{fin>>n;
genpermutari(1);
return 0;
}
