Pagini recente » Cod sursa (job #948507) | Cod sursa (job #1954458) | Cod sursa (job #2283520) | Cod sursa (job #80755) | Cod sursa (job #2365398)
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, a[20], k;
void type()
{
for(int i = 1; i <= k; i++)
cout<<a[i]<<' ';
cout<<'\n';
}
void bt(int p)
{
if(p == k + 1) type();
else for(a[p]=a[p-1]+1; a[p] <= n-p+k; a[p]++) bt(p+1);
}
int main()
{
cin>>n>>k;
cin.close();
bt(1);
cout.close();
return 0;
}