Pagini recente » Cod sursa (job #1017232) | Istoria paginii utilizator/olteanclan | Cod sursa (job #1683513) | Cod sursa (job #862308) | Cod sursa (job #1462453)
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[30], n,k;
void Afisare()
{
int i;
for (i = 1; i <= k; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back(int top)
{
int i;
if (top == k+1) Afisare();
else for (i = st[top-1]+1; i <= n-k+top; i++)
{
st[top] = i;
Back(top+1);
}
}
int main()
{
fin >> n >>k;
Back(1);
fin.close();
fout.close();
}