Cod sursa(job #2177856)
| Utilizator | Data | 18 martie 2018 21:15:49 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int A[20];
int N, K;
ifstream iff("combinari.in");
ofstream off("combinari.out");
void back(int l) {
if (l >= K) {
for (int i = 0; i < K; ++i) {
off << A[i] << " ";
}
off << endl;
}
else {
int start = l < 0 ? 1 : A[l - 1];
for (int i = start + 1; i <= N; ++i) {
A[l] = i;
back(l + 1);
}
}
}
int main() {
iff >> N >> K;
back(0);
}