Cod sursa(job #2444953)
| Utilizator | Data | 1 august 2019 21:04:46 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,v[10];
void afisare()
{
for(int i=1;i<=n;i++)
fout<<v[i]<<" ";
fout<<"\n";
}
bool OK(int k)
{
for(int i=1;i<k;i++)
if(v[i]==v[k])
return false;
return true;
}
void back(int k)
{
if(k==n+1)
{
afisare();
return;
}
for(int i=1;i<=n;i++)
{
v[k]=i;
if(OK(k))
back(k+1);
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
