Cod sursa(job #2033502)
Utilizator | Gabriel Boroghina gabib97 | Data | 6 octombrie 2017 21:34:52 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int n, k, v[20];
void back(int p)
{
if (p > k)
{
for (int i = 1; i <= k; i++) printf("%i ", v[i]);
printf("\n");
}
else
for (int i = v[p - 1] + 1; i <= n - k + p; i++)
{
v[p] = i;
back(p + 1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%i%i", &n, &k);
back(1);
return 0;
}