Pagini recente » Cod sursa (job #1454570) | Cod sursa (job #3130044) | Cod sursa (job #1338760) | Cod sursa (job #2911831) | Cod sursa (job #1657315)
#include <iostream>
#include <stdio.h>
using namespace std;
int n, k, t, v[19], i;
FILE* f;
int main()
{
f = fopen("combinari.in", "r");
fscanf(f, "%d%d", &n, &k);
f = freopen("combinari.out", "w", f);
t = 1;
v[0] = v[1] = 0;
while(t>0)
{
while(v[t] < n)
{
++v[t];
if(t == k)
{
for(i = 1; i<=k; ++i)
fprintf("%d ", v[i]);
fprintf("\n");
}
else
{
++t;
v[t] = v[t-1];
}
}
--t;
}
fclose(f);
return 0;
}