Cod sursa(job #2486341)
Utilizator | Data | 2 noiembrie 2019 18:35:33 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, k, c[20];
void afisare () {
for (int i = 1; i <= k; i++)
fout << c[i] << " ";
fout << "\n";
}
void combinari (int l) {
if (l > k) {
afisare();
return;
}
for (int i = c[l-1]+1; i <= n; i++) {
c[l] = i;
combinari(l+1);
}
}
int main()
{
fin >> n >> k;
combinari(1);
return 0;
}