Cod sursa(job #1221734)
| Utilizator | Data | 21 august 2014 13:16:58 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in ("permutari.in");
ofstream out ("permutari.out");
int n,ocup[10],perm[10];
void calc(int pos)
{
if (pos==n+1)
{
for (int i=1;i<=n;++i) out<<perm[i]<<" ";
out<<"\n";
}else
{
for (int i=1;i<=n;++i)
{
if (ocup[i]==0)
{
perm[pos]=i;
ocup[i]=1;
calc(pos+1);
ocup[i]=0;
}
}
}
}
int main()
{
in>>n;
calc(1);
in.close();
out.close();
return 0;
}
