Cod sursa(job #2641193)
| Utilizator | Data | 10 august 2020 14:36:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, k, a[19];
void afisol () {
for (int i = 1; i <= k; i++)
fout << a[i] << ' ';
fout << '\n';
}
void bkt (int d) {
if (d == k + 1)
afisol ();
for (int i = a[d - 1] + 1; i <= n; i++) {
a[d] = i;
bkt (d + 1);
}
}
int main()
{
fin >> n >> k;
bkt (1);
return 0;
}
