Cod sursa(job #1756796)
Utilizator | Theodor Moroianu theodor.moroianu | Data | 13 septembrie 2016 17:36:10 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int v[20], c = 0, n, k;
void bkt(int p);
void afis();
ofstream out;
int main()
{
ifstream in("combinari.in");
out.open("combinari.out");
in >> n >> k;
bkt(1);
return 0;
}
void bkt(int p)
{
if (c == k) {
afis();
return;
}
for (int i = p; i <= n; i++) {
if (n - i < k - c - 1)
return;
c++;
v[c] = i;
bkt(i + 1);
c--;
}
}
void afis()
{
for (int i = 1; i <= c; i++)
out << v[i] << " \n"[i == c];
}