Cod sursa(job #1428423)
| Utilizator | Data | 4 mai 2015 15:30:29 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, v[10];
void afis()
{
for(int i=1;i<=n;i++)
fout<<v[i]<<" ";
fout<<'\n';
}
int verif(int k)
{
for(int i=1;i<=k-1;i++)
if(v[i]==v[k])
return 0;
return 1;
}
void back(int k)
{
if(k<=n)
{
for(int i=1;i<=n;i++)
{
v[k]=i;
if(verif(k))
back(k+1);
}
}
else
afis();
}
int main()
{
fin>>n;
back(1);
return 0;
}
