Cod sursa(job #1200335)
| Utilizator | Data | 22 iunie 2014 10:36:58 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("permutari.in"); ofstream g("permutari.out");
int n,x[9];
void afis()
{ for(int i=1;i<=n;i++) g<<x[i]<<" ";
g<<"\n";
}
int cont(int k)
{ for(int i=1;i<k;i++)
if(x[i]==x[k]) return 0;
return 1;
}
void back(int k)
{ for(int i=1;i<=n;i++)
{ x[k]=i;
if(cont(k))
if(k==n) afis(); else back(k+1);
}
}
int main()
{ f>>n;
back(1);
g.close();
return 0;
}
