Cod sursa(job #160242)
Utilizator | Data | 14 martie 2008 21:48:35 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#define N 10
int st[N + 1], n, k;
void back(int nivel)
{
if(nivel == k + 1)
{
for(int i = 1; i <= k; ++i) printf("%d ", st[i]);
printf("\n");
}
else
{
for(st[nivel] = st[nivel - 1] + 1; st[nivel] <= n; ++st[nivel])
{
back(nivel + 1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
fclose(stdin);
back(1);
fclose(stdout);
return 0;
}