Cod sursa(job #2023868)
Utilizator | Data | 19 septembrie 2017 16:52:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int u[19],a[19],n,k;
void afs()
{
for(int i=1;i<=k;i++) fout<<a[i]<<" ";
fout<<'\n';
}
void bk(int m)
{
for(int i=a[m-1]+1;i<=n;i++)
if(u[i]==0)
{
a[m]=i;
u[i]=1;
if(m==k) afs();
else bk(m+1);
u[i]=0;
}
}
int main()
{
fin>>n>>k;
bk(1);
return 0;
}