Cod sursa(job #1865876)
| Utilizator | Data | 2 februarie 2017 11:21:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,v[19],a[19];
void afis()
{
for(int i=1;i<=k;i++)
fout<<v[i]<<' ';
fout<<'\n';
}
void bkt(int z, int l)
{
if(z-1==k)
afis();
else
{
for(int i=1;i<=l;i++)
{
if(!a[i] && v[z-1]<i)
{
v[z]=i;
a[i]=i;
bkt(z+1,l);
a[i]=0;
}
}
}
}
int main()
{
fin>>n>>k;
bkt(1,n);
return 0;
}
