Pagini recente » Cod sursa (job #43297) | Cod sursa (job #1159075) | Cod sursa (job #10706) | Argumentatia | Cod sursa (job #581154)
Cod sursa(job #581154)
#include <stdio.h>
using namespace std;
int N, K;
int M[20];
void Afiseaza()
{
for (int i=0; i<K; i++)
printf("%d ", M[i]);
printf("\n");
}
void Back (int index, int last)
{
if (index == K) Afiseaza();
else for (int i=last+1; i<=N; i++)
{
M[index] = i;
Back(index+1, i);
}
}
int main()
{
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf("%d %d", &N, &K);
Back(0,0);
return 0;
}