Cod sursa(job #1739837)
| Utilizator | Data | 10 august 2016 12:43:25 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int st[9];
int n;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
void tipar (int k)
{
int i;
for(i=1; i<=k; i++)
fout<<st[i]<<' ';
fout<<'\n';
}
bool valid (int k)
{
int i;
for(i=1; i<=k-1; i++)
if(st[k]==st[i])
return false;
return true;
}
void back (int k)
{
int i;
for(i=1; i<=n; i++)
{
st[k]=i;
if(valid(k))
{
if(k==n)
tipar(k);
else
back(k+1);
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
