Cod sursa(job #1976052)
Utilizator | Bouruc Petru Liviu BourucLiviu | Data | 2 mai 2017 17:49:58 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
using namespace std;
int n, k, v[20];
void afisare()
{
for(int i = 1; i <= k; ++i) printf("%d ", v[i]);
printf("\n");
}
void bkt(int l)
{
for(int i = v[l-1] + 1; i <= n; ++i)
{
v[l] = i;
if(l == k) afisare();
else bkt(l+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
fclose(stdin);
bkt(1);
fclose(stdout);
return 0;
}