Cod sursa(job #2509143)
Utilizator | Data | 13 decembrie 2019 21:15:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int N, subm[25], K;
void gen(int element, int lgSubm) {
if (element == N + 1) {
if(lgSubm == K) {
for (int i = 0; i < lgSubm; ++i)
g<<subm[i]<<' ';
g<<"\n";
}
return;
}
subm[lgSubm] = element;
gen(element + 1, lgSubm + 1);
gen(element + 1, lgSubm);
}
int main()
{
f >> N >> K;
int element = 1;
int lgSubm = 0;
gen(element, lgSubm);
return 0;
}