Pagini recente » Cod sursa (job #2336206) | Cod sursa (job #1598035) | Cod sursa (job #1593894) | Cod sursa (job #1947390) | Cod sursa (job #227265)
Cod sursa(job #227265)
#include <stdio.h>
int k,v[128],x[16],N,K;
void back()
{
++k;
if (k>K)
{
for(char j=1;j<k;++j)
printf("%d ", x[j]);
printf("\n");
} else
for(x[k]=x[k-1]+1;x[k]<=N;++x[k]) back();
--k;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &N,&K);
// back();
k=1;
while (k)
{
#define Q if (k){ if (++v[k] > N) --k; else if (k==K) { for(char j=1;j<=k;++j) printf("%d ", v[j]); printf("\n"); } else if (v[k] <= N) { ++k;v[k] = v[k-1]; } else --k; }
#define W Q
#define E Q W
#define R Q W E
#define T Q W E R
#define Y Q W E R T
#define X Q W E R T Y
X X X
}
return 0;
}