Pagini recente » Cod sursa (job #712735) | Cod sursa (job #256008) | Cod sursa (job #239259) | Cod sursa (job #1712657) | Cod sursa (job #2838734)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
#define DIM 20
int sol[DIM + 1], n, m;
static inline void Afis() {
for(int i = 1; i <= m; i++)
cout << sol[i] << " ";
cout << '\n';
}
static inline void Back(int k) {
if(k > m)
Afis();
else for(int i = sol[k - 1] + 1; i <= n; i++) {
sol[k] = i;
Back(k + 1);
}
}
int main() {
cin >> n >> m;
Back(1);
return 0;
}