Cod sursa(job #683319)
Utilizator | Bogdan Beldea beldeabogdan | Data | 20 februarie 2012 14:24:22 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
using namespace std;
int v[20],n,i,k,m;
void af() {
for (int j=1;j<=m;j++) printf("%d ",v[j]);printf("\n");
}
void comb (int k) {
if (k>m) af();
else {
for (int i=v[k-1]+1;i<=n-m+k;i++) {
v[k]=i;
comb(k+1);
}
}
}
int main() {
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
comb(1);
return 0;
}