Cod sursa(job #2655352)
Utilizator | Data | 4 octombrie 2020 09:46:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int N, M, solutie[20];
void bkt(int pos) {
if(pos == M + 1) {
for(int i = 1; i <= M; i++) {
fout << solutie[i] << ' ';
}
fout << '\n';
}
else {
for(int valoare = solutie[pos - 1] + 1; valoare <= N; valoare++) {
solutie[pos] = valoare;
bkt(pos + 1);
solutie[pos] = 0;
}
}
}
int main()
{
fin>>N>>M;
bkt(1);
return 0;
}