Cod sursa(job #161277)
Utilizator | Data | 17 martie 2008 20:39:29 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<stdio.h>
#define nmax 20
int n,k;
int s[nmax];
void read()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
}
void print()
{
int i;
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
void bec( int p)
{
for(int i=s[p-1]+1;i<=n;i++)
{
s[p]=i;
if(p==k)
print();
else
bec(p+1);
}
}
int main()
{
read();
bec(1);
return 0;
}