Cod sursa(job #2282684)
| Utilizator | Data | 14 noiembrie 2018 12:31:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
int v[20];
int n,k;
inline void bkt(int strat,int lft)
{
if(strat==n)
{
for(int i=1;i<=k;i++)
{
cout<<v[i]<<" ";
}
cout<<"\n";
}
else
{
if(lft)
{
v[k-lft+1]=strat+1;
bkt(strat+1,lft-1);
}
if(n-strat-1>=lft)
{
bkt(strat+1,lft);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
cin>>n>>k;
bkt(0,k);
return 0;
}
