Cod sursa(job #445321)
Utilizator | Data | 23 aprilie 2010 15:14:05 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
int n,k, sol[20];
void citire()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &n, &k);
}
void pr()
{
for(int i=1;i<=k;++i)
printf("%d ", sol[i]);
printf("\n");
}
void back(int l)
{
if(l)
{
for(sol[l]=sol[l-1]+1;l<=k &&k-l<=n-sol[l];sol[l]++)
if(l==k)
pr();
else
back(l+1);
//back(--l);
}
}
int main()
{
citire();
back(1);
}