Cod sursa(job #288837)
| Utilizator | Data | 26 martie 2009 09:58:30 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream.h>
int n,k,x[20];
ifstream f("permutari.in");
ofstream g("permutari.out");
void tipar()
{
int i;
for (i=1;i<=k;i++) g<<x[i]<<" ";
g<<'\n';
}
int valid(int k)
{
int i;
for (i=1;i<k;i++)
if (x[i]==x[k]) return 0;
return 1;
}
int sol(int k)
{
if (k==n) return 1;
return 0;
}
void back()
{
k=1;
x[k]=0;
while (k>0)
if (x[k]<n)
{
x[k]++;
if (valid(k))
if (sol(k)) tipar();
else {k++;x[k]=0;}
}
else k--;
}
int main()
{
f>>n;
back();
return 0;
}