Cod sursa(job #530570)
Utilizator | Data | 7 februarie 2011 23:19:32 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int a[10],n;
void perm(int);
void afisare();
int uz(int);
int main()
{ in>>n;
perm(1);
return 0;
}
void perm(int k)
{ if(k==n+1)
{ afisare();
return;
}
for(int i=1;i<=n;i++)
{ a[k]=i;
if(uz(k))
perm(k+1);
}
}
int uz(int k)
{ for(int i=1;i<k;i++)
if(a[k]==a[i])
return 0;
return 1;
}
void afisare()
{ for(int i=1;i<=n;i++)
out<<a[i]<<" ";
out<<'\n';
}