Pagini recente » Cod sursa (job #838048) | Cod sursa (job #2485057) | Cod sursa (job #2279176) | Cod sursa (job #2682644) | Cod sursa (job #1121298)
#include <cstdio>
using namespace std;
int N, K;
int C[20];
void afis()
{
for (int i = 1; i <= K; ++i)
printf("%d ", C[i]);
printf("\n");
}
void comb(const int pz)
{
if (pz > K)
return afis();
for (int i = C[pz - 1] + 1; i <= N; ++i)
{
C[pz] = i;
comb(pz + 1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &N, &K);
comb(1);
fclose(stdout);
return 0;
}