Pagini recente » Cod sursa (job #3247069) | Cod sursa (job #2802414) | Statistici Vlad Bondoc (pkse) | Cod sursa (job #2176887) | Cod sursa (job #153539)
Cod sursa(job #153539)
#include <stdio.h>
#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
int N, K;
int st[20];
void back( int k, int Max )
{
if (k == K)
{
FOR(i, 0, K)
printf("%d ", st[i]);
printf("\n");
return;
}
for (int i = Max + 1; i <= N - K + k + 1; i++)
st[k] = i,
back( k + 1, i );
}
int main()
{
freopen("combinari.in", "rt", stdin);
freopen("combinari.out", "wt", stdout);
scanf("%d %d", &N, &K);
back(0, 0);
return 0;
}