Cod sursa(job #1457025)
| Utilizator | Data | 2 iulie 2015 16:24:47 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,st[10],used[10];
void afisare(int k)
{
for (int i=1; i<=k; ++i) g<<st[i]<<' ';
g<<'\n';
}
void Back(int k)
{
if (k==n+1)
{
afisare(k-1);
return;
}
for (int i=1; i<=n; ++i)
if (used[i]==0)
{
used[i]=1;
st[k]=i;
Back(k+1);
used[i]=0;
}
}
int main()
{
f>>n;
Back(1);
f.close();
g.close();
return 0;
}
