Pagini recente » Cod sursa (job #3285034) | Cod sursa (job #1803891) | Cod sursa (job #1215222) | Cod sursa (job #3273336) | Cod sursa (job #3257619)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[20], n ,k;
void Afis(int n)
{
for (int i = 1; i <= n; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back(int top)
{
if (top == k + 1) Afis(k);
else for (int i = 1+st[top-1]; i <= n; i++)
{
st[top] = i;
Back(top + 1);
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}