Cod sursa(job #153607)
Utilizator | Ionescu Vlad Dastas | Data | 10 martie 2008 17:15:30 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
const int maxn = 32;
FILE *in = fopen("combinari.in","r"), *out = fopen("combinari.out","w");
int n, k;
int st[maxn];
void back(int q)
{
if ( q > k )
{
for ( int i = 1; i <= k; ++i )
fprintf(out, "%d ", st[i]);
fprintf(out, "\n");
return;
}
for ( int i = st[q-1] + 1; i <= n; ++i )
st[q] = i, back(q+1);
}
int main()
{
fscanf(in, "%d %d", &n, &k);
back(1);
return 0;
}