Pagini recente » Cod sursa (job #3231307) | Cod sursa (job #499288) | Cod sursa (job #2219451) | Cod sursa (job #1488172) | Cod sursa (job #2723428)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
void usain_bolt()
{
ios::sync_with_stdio(false);
fin.tie(0);
}
const int N = 2e1 + 5;
int sol[N], n, m;
bool f[N];
void solve(int k)
{
for(int i = sol[k - 1] + 1; i <= n; ++i) {
if(f[i] == false) {
f[i] = true;
sol[k] = i;
if(k < m) {
solve(k + 1);
}
else {
for(int i = 1; i <= m; ++i) {
fout << sol[i] << " ";
}
fout << "\n";
}
f[i] = false;
}
}
}
int main()
{
usain_bolt();
fin >> n >> m;
solve(1);
return 0;
}