Cod sursa(job #277779)
Utilizator | Data | 11 martie 2009 21:46:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
long n,k,i,a[20];
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld%ld",&n,&k);
for(i=1;i<=k;++i){a[i]=i;printf("%ld ",i);}
printf("\n");
while(a[1]<n-k+1)
{for(i=k;a[i]==n-k+i;--i);
++a[i];
for(i=i+1;i<=k;++i)
a[i]=a[i-1]+1;
for(i=1;i<=k;++i)
printf("%ld ",a[i]);
printf("\n");}
return 0;
}