Cod sursa(job #2120152)
| Utilizator | Data | 1 februarie 2018 23:06:12 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, st[10], viz[10];
void solutie()
{
for(int i=1; i<=n; i++)
fout<<st[i]<<' ';
fout<<'\n';
}
void bt(int k)
{
if(k==n+1)
solutie();
else for(int i=1; i<=n; i++)
if(!viz[i])
{
viz[i]=1;
st[k]=i;
bt(k+1);
viz[i]=0;
}
}
int main()
{
fin>>n;
bt(1);
fout.close();
return 0;
}
