Cod sursa(job #326031)
Utilizator | Data | 23 iunie 2009 15:36:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
long n,k,s[20];
void back(long l)
{
long i;
if (l==k)
{
for(i=1;i<=k;++i)
printf("%ld ",s[i]);
printf("\n");
}
else
{
for(i=s[l]+1;i<=n;++i)
{
s[l+1]=i;
back(l+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld%ld",&n,&k);
back(0);
return 0;
}