Pagini recente » Cod sursa (job #1393381) | Cod sursa (job #666207) | Borderou de evaluare (job #1900520) | Cod sursa (job #2864222) | Cod sursa (job #2790102)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, st[20];
void write(int top)
{
for(int i = 1; i < top; i ++)
fout << st[i] << " ";
fout << '\n';
}
void Back(int top)
{
if(top == k + 1)
write(top);
else
{
for(int i = st[top - 1] + 1; i <= n; i ++)
{
st[top] = i;
Back(top + 1);
}
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}