Pagini recente » Cod sursa (job #2049657) | Cod sursa (job #690103) | Cod sursa (job #1414243) | Cod sursa (job #1865534) | Cod sursa (job #2206801)
#include <iostream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, k, st[10000];
void Afis()
{
for(int i = 1; i <= k; i++)
cout << st[i] << " ";
cout << '\n';
}
void BT(int p)
{
if(p == k+1)
Afis();
else
for(int i = st[p-1]+1; i <= n; i++)
{
st[p] = i;
BT(p+1);
}
}
int main()
{
cin >> n >> k;
BT(1);
return 0;
}