Cod sursa(job #1113013)
| Utilizator | Data | 20 februarie 2014 11:21:55 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int N, used[10], st[10];
void afisare()
{
for (int i=1; i<=N; ++i)
g<<st[i]<<' '; g<<'\n';
}
void back(int top)
{
if (top>N) afisare();
for (int i=1; i<=N; ++i)
if (!used[i])
{
st[top]=i; used[i]=1;
back(top+1);
used[i]=0;
}
}
int main()
{
f>>N;
back(1);
return 0;
}
