Cod sursa(job #2026935)
| Utilizator | Data | 25 septembrie 2017 12:58:18 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,fol[100],perm[100];
void afisare()
{
int i;
for(i=1;i<=n;i++)
g<<perm[i]<<" ";
g<<"\n";
}
void back(int pas)
{
int i;
if(pas>n)
{
afisare();
}
else{
for(i=1;i<=n;i++)
{
if(!fol[i])
{
perm[pas]=i;
fol[i]=1;
back(pas+1);
fol[i]=0;
}
}
}
}
int main ()
{
f>>n;
back(1);
}
