Cod sursa(job #1218664)
| Utilizator | Data | 12 august 2014 11:05:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, st[9];
void citire()
{
f>>n;
}
int valid(int k)
{
int i;
for(i=1;i<k;i++)if(st[i]==st[k])return 0;
return 1;
}
void afis()
{
int i;
for(i=1;i<=n;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(k==n)afis();
else bkt(k+1);
}
}
}
int main()
{
citire();
bkt(1);
f.close();
g.close();
return 0;
}
