Cod sursa(job #2465975)
| Utilizator | Data | 1 octombrie 2019 09:55:49 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int perm[16];
int fol[16];
int n;
void permutari(int k)
{
if(k==n+1)
{
for(int i=1; i<=n; i++)
out<<perm[i]<<" ";
out<<'\n';
}
for(int j=1; j<=n; j++)
{
if(!fol[j])
{
perm[k]=j;
fol[j]=1;
permutari(k+1);
fol[j]=0;
}
}
}
int main()
{
in>>n;
permutari(1);
in.close();
out.close();
return 0;
}
