Cod sursa(job #1739380)
Utilizator | Data | 9 august 2016 13:13:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.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]);
printf("\n");
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;
}
}