Cod sursa(job #3203603)
Utilizator | David Enachescu Uengine | Data | 13 februarie 2024 23:45:52 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int v[20], n, k;
void afisare(){
for(int i = 1; i <= k; ++i)
cout << v[i] << ' ';
cout << '\n';
}
void bkt(int pas){
for(int i = v[pas - 1] + 1; i <= n; i++){
v[pas] = i;
if(pas == k)
afisare();
else
bkt(pas + 1);
}
}
int main() {
cin >> n >> k;
bkt(1);
return 0;
}