Pagini recente » Monitorul de evaluare | Istoria paginii utilizator/adiolariu | Borderou de evaluare (job #1486134) | Cod sursa (job #1739379)
#include <cstdio>
using namespace std;
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinati.out", "w", stdout);
int n, k, v[19], m;
scanf("%d%d", &n, &k);
for(int i=1; i<=k; i++) v[i]=i;
while(true)
{
for(int i=1; i<=k; i++) printf("%d ", v[i]);
m=k;
while(m>=1 && n-k+m==v[m]) m--;
if(m==0) break;
v[m]++;
for(int i=m+1; i<=k; i++) v[i]=v[i-1]+1;
}
}