Pagini recente » Istoria paginii runda/wellcodesimulareclasa10-11martie/clasament | Istoria paginii runda/oji.2k16/clasament | Monitorul de evaluare | Cod sursa (job #1371499) | Cod sursa (job #1218773)
#include <cstdio>
using namespace std;
int N,K,v[30];
void afish()
{
for(int i = 1; i <= K; ++i)
printf("%d ",v[i]);
printf("\n");
}
void back(int k)
{
for(v[k] = v[k-1] + 1; v[k] <= N - K + k ; ++v[k])
if(k < K)
back(k+1);
else
afish();
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&K);
back(1);
return 0;
}