Pagini recente » Borderou de evaluare (job #1015087) | Cod sursa (job #2244654) | Cod sursa (job #1741673) | Cod sursa (job #2454649) | Cod sursa (job #922513)
Cod sursa(job #922513)
#include <cstdio>
using namespace std;
FILE * fin = freopen("combinari.in", "r", stdin);
FILE * fout = freopen("combinari.out", "w", stdout);
int n, k;
int s[20];
void afis()
{
int i;
for (i = 1; i <= k; i++)
printf("%d ", s[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k == ::k + 1)
afis();
else
for (i = s[k-1] + 1; i <= n; i++)
{
s[k] = i;
back(k + 1);
}
}
int main()
{
scanf("%d%d", &n, &k);
back(1);
return 0;
}