Pagini recente » Istoria paginii utilizator/mary136 | Diferente pentru numerele-sprague-grundy intre reviziile 37 si 38 | Istoria paginii blog/a-trecut-si-olimpiada | Istoria paginii runda/rf__1 | Cod sursa (job #1551113)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[20], n, k;
void Afisare()
{
for(int i = 1; i <= k; i++)
fout << st[i] << " ";
fout <<"\n";
}
inline void Back(int top)
{
int i;
if(top == k + 1) Afisare();
else for(i = 1 + st[top - 1]; i <= n - k + top; i++)
{
st[top] = i;
Back(top + 1);
}
}
int main()
{
fin >> n >> k;
fin.close();
Back(1);
fout.close();
return 0;
}