Cod sursa(job #3353636)
| Utilizator | Data | 8 mai 2026 20:21:18 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int x[20];
void back(int poz) {
if (poz > k) {
for (int i = 1; i <= k; i++)
fout << x[i] << ' ';
fout << '\n';
return;
}
int start;
if (poz == 1)
start = 1;
else
start = x[poz - 1] + 1;
for (int i = start; i <= n; i++) {
x[poz] = i;
back(poz + 1);
}
}
int main() {
fin >> n >> k;
back(1);
return 0;
}
