Pagini recente » Rezultatele filtrării | Cod sursa (job #220272) | Cod sursa (job #450610) | Cod sursa (job #2633177) | Cod sursa (job #604565)
Cod sursa(job #604565)
#include <iostream>
#define NMax 20
using namespace std;
int N, K, Stack[NMax];
void Print ()
{
for (int i=1; i<=K; ++i)
{
printf ("%d ", Stack[i]);
}
printf ("\n");
}
void Back (int k)
{
if (k==K+1)
{
Print ();
return;
}
for (int i=Stack[k-1]+1; i<=N; ++i)
{
Stack[k]=i;
Back (k+1);
Stack[k]=0;
}
}
int main()
{
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf ("%d %d", &N, &K);
Back (1);
return 0;
}