Pagini recente » Cod sursa (job #1483107) | Cod sursa (job #2849224) | Cod sursa (job #1722039) | Cod sursa (job #192121) | Cod sursa (job #2751486)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[20], n, v[20], k;
void Afis(int n)
{
for (int i = 1; i <= k; i++)
fout << st[i] << " ";
fout << "\n";
}
void Comb(int top)
{
if (top == k + 1) Afis(k);
else
for (int i = st[top - 1] + 1; i <= n - k + top; i++)
{
st[top] = i;
Comb(top + 1);
}
}
int main()
{
fin >> n >> k;
Comb(1);
fin.close();
fout.close();
return 0;
}