Pagini recente » Borderou de evaluare (job #1139984) | Cod sursa (job #2602650) | Borderou de evaluare (job #1621885) | Borderou de evaluare (job #1284405) | Cod sursa (job #1974394)
#include <cstdio>
using namespace std;
int N, K;
int v[1005];
void Back(int k)
{
for(v[k] = v[k-1] + 1; v[k] <= N; ++v[k])
if(k < K)
Back(k + 1);
else {
for(int i = 1; i <= K; ++i)
printf("%d ",v[i]);
printf("\n");
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d",&N, &K);
Back(1);
return 0;
}