Cod sursa(job #1914770)
| Utilizator | Data | 8 martie 2017 18:30:46 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int x[100],n;
void afis(){
int i;
for(i=1;i<=n;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
int cont(int k){
int i;
for(i=1;i<k;i++)
if(x[k]==x[i])
return 0;
return 1;
}
void back(int k){
int i;
if(k>n)
afis();
else
for(i=1;i<=n;i++)
{
x[k]=i;
if(cont(k)==1)
back(k+1);
}
}
int main()
{ fin>>n;
back(1);
return 0;
}
