Pagini recente » Cod sursa (job #2577907) | Cod sursa (job #2523851) | Rating Tudor Andrei (varena2005) | Cod sursa (job #710065) | Cod sursa (job #3213938)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, st[20];
void Afis(int top)
{
int i;
for (i = 1; i < top; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back(int top)
{
if (top == m + 1)
Afis(top);
else
for (int i = st[top - 1] + 1; i <= n; i++)
{
st[top] = i;
Back(top + 1);
}
}
int main()
{
fin >> n >> m;
Back(1);
return 0;
}