Cod sursa(job #1637261)
Utilizator | Data | 7 martie 2016 16:06:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int n, k;
int x[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void bkt(int i) {
int lim = n - k + i;
for(int j = x[i - 1] + 1; j <= lim; j ++) {
x[i] = j;
if(i == k) {
for(int o = 1; o <= k; o ++) g << x[o] << " ";
g << "\n";
}
else bkt(i + 1);
}
}
int main()
{
f >> n >> k;
bkt(1);
return 0;
}