Cod sursa(job #2206796)
| Utilizator | Data | 23 mai 2018 20:26:33 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int st[10],vf,n,f[10];
void afisare(int vf)
{
int i;
for(i=1;i<=vf;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void back(int vf)
{
int i;
for(i=1;i<=n;i++)
if(f[i]==0)
{
f[i]++;
st[vf]=i;
if(vf==n)
afisare(vf);
else back(vf+1);
f[i]=0;
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
