Pagini recente » Cod sursa (job #2644857) | Cod sursa (job #859571) | Cod sursa (job #202251) | Cod sursa (job #1980992) | Cod sursa (job #1495294)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int v[20];
void back(int k) {
if (k > m) {
for (int i = 1; i < k; ++i) {
fout << v[i] << ' ';
}
fout << '\n';
}
else {
for (int i = v[k - 1] + 1; i <= n; ++i) {
v[k] = i;
back(k + 1);
v[k] = 0;
}
}
}
int main() {
fin >> n >> m;
back(1);
fout.close();
return 0;
}