Cod sursa(job #3283793)
Utilizator | Data | 10 martie 2025 15:09:32 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare(int v[], int pas) {
for(int i = 1; i <= pas; i++) {
fout << v[i] << ' ';
}
fout << endl;
}
void back(int v[], int n, int k, int pas) {
if(pas == k + 1){
afisare(v, k);
}else {
for(int i = v[pas - 1] + 1; i <= n; i++) {
v[pas] = i;
back(v, n, k, pas + 1);
}
}
}
int main() {
int n, v[20], k;
fin >> n >> k;
v[0] = 0;
back(v, n, k, 1);
}