Cod sursa(job #1852394)
| Utilizator | Data | 20 ianuarie 2017 19:28:04 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
#define nmax 9
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int st[nmax],n;
int valid(int p)
{
int i;
for(i=1;i<p;i++)
if(st[p]==st[i])
return 0;
return 1;
}
int solutie(int p)
{
return p==n;
}
int afis(int p)
{
int i;
for(i=1;i<=n;i++)
fout<<st[i]<<" ";
fout<<'\n';
}
void bk(int p)
{
int i;
for(i=1;i<=n;i++)
{
st[p]=i;
if(valid(p))
{
if(solutie(p))
afis(p);
else
bk(p+1);
}
}
}
int main()
{
fin>>n;
bk(1);
return 0;
}
