Cod sursa(job #2538351)
Utilizator | Data | 4 februarie 2020 17:58:55 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
int n, sir[19];
void bkt(int k, int lg) {
if (lg == k) {
for (int i = 1; i <= k; i++)
cout << sir[i] << ' ';
cout << '\n';
return;
}
for (int i = sir[lg] + 1; i <= n; i++) {
sir[lg + 1] = i;
bkt(k, lg + 1);
}
}
int k;
int main()
{
cin >> n >> k;
bkt(k,0);
return 0;
}