Cod sursa(job #2030006)
| Utilizator | Data | 30 septembrie 2017 20:35:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int v[20],n,k;
void afisare()
{
for(int i=1;i<=k;++i)
printf("%d ",v[i]);
printf("\n");
}
void bkt(int poz)
{
for(int i=v[poz-1]+1;i<=n-k+v[poz-1]+1&&i<=n;++i)
{
v[poz]=i;
if(poz==k)
{
afisare();
}
else
bkt(poz+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bkt(1);
return 0;
}
