Pagini recente » Borderou de evaluare (job #2454981) | Borderou de evaluare (job #1340038) | Borderou de evaluare (job #1581093) | Borderou de evaluare (job #506153) | Cod sursa (job #1607800)
#include <stdio.h>
int N, K,i;
int st[20];
void back( int k, int Max )
{
if (k == K)
{
for( i =0; i < k; ++i)
printf("%d ", st[i]);
printf("\n");
return;
}
for ( 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;
}