Cod sursa(job #1067755)
| Utilizator | Data | 27 decembrie 2013 14:46:55 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int st[10], n;
int valid(int k)
{
int i;
for(i=1;i<k;i++)if(st[i]==st[k])return 0;
return 1;
}
int solutie(int k)
{
if(k==n)return 1;
return 0;
}
void afis(int k)
{
int i;
for(i=1;i<=k;i++)g<<st[i]<<" ";
g<<'\n';
}
void bkt(int k)
{
int i;
for(i=1;i<=n;i++)
{
st[k]=i;
if(valid(k))
{
if(solutie(k))afis(k);
else bkt(k+1);
}
}
}
int main()
{
f>>n;
bkt(1);
f.close();
g.close();
return 0;
}
