Cod sursa(job #2103687)
Utilizator | Data | 10 ianuarie 2018 17:37:16 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
//#include "stdafx.h"
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, v[20];
void BKT(int i) {
for (int j = v[i - 1] + 1; j <= n; j++) {
v[i] = j;
if (i == k) {
for (int p = 1; p <= k; p++)
g << v[p] << ' ';
g << '\n';
}
else BKT(i + 1);
}
}
int main()
{
f >> n >> k;
BKT(1);
return 0;
}