Cod sursa(job #279907)
| Utilizator | Data | 13 martie 2009 08:51:33 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n,st[10];
int valid(int p)
{
if(p>1)
for(int i=1;i<p;i++)
if(st[i]==st[p])
return 0;
return 1;
}
void bkt(int p)
{
for(int val=1;val<=n;val++)
{
st[p]=val;
if(valid(p)==1)
if(p==n)
{
for(int i=1;i<=n;i++) fout<<st[i]<<" ";
fout<<endl;
}
else bkt(p+1);
}
}
int main()
{
fin>>n;
bkt(1);
return 0;
}
