Pagini recente » Cod sursa (job #3269930) | Cod sursa (job #3268413) | Cod sursa (job #2603768) | Cod sursa (job #3268203) | Cod sursa (job #3245133)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[15],fr[15], 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 = st[top - 1] + 1; i <= n; i++)
{
st[top] = i;
Back(top + 1);
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}