Cod sursa(job #1040344)
Utilizator | Casu-Pop Andrei andy1496 | Data | 24 noiembrie 2013 14:02:16 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int n,k,s[21];
void comb (int l) {
int i;
if (l==k){ for (i=1; i<=k; i++) printf ("%d ", s[i]); printf("\n"); }
else {
for (i=s[l]+1; i<=n; i++) {
s[l+1]=i;
comb(l+1);
}
}
}
int main () {
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf ("%d %d", &n, &k);
comb(0);
return 0;
}