Cod sursa(job #220233)
Utilizator | andreea martinovici andreea_m | Data | 9 noiembrie 2008 21:01:56 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
int n,p,st[20];
void tipar()
{
int i;
for(i=1;i<=p;i++)
printf("%d ", st[i]);
printf("\n");
}
void bkt(int k)
{
int i;
if(k==p+1)
{
tipar();
return;
}
for(i=st[k-1]+1;i<=n-p+k;i++)
{
st[k]=i;
bkt(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
bkt(1);
return 0;
}