Pagini recente » Cod sursa (job #163340) | Monitorul de evaluare | Cod sursa (job #1330281) | Cod sursa (job #231625) | Cod sursa (job #1472279)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, s[19], k;
void bk(int i) {
if (s[1] == n){
return;
}
if (i == k){
int j;
for (j = 1; j <= i; ++j)
g << s[j] << " ";
g << "\n";
}
if (s[i] == n) {
i--;
s[i]++;
} else {
if (i == k)
s[i]++;
else {
i++;
s[i] = s[i - 1] + 1;
}
}
bk(i);
}
int main(){
f >> n >> k;
bk(0);
f.close();
g.close();
return 0;
}