Pagini recente » Istoria paginii runda/contest_2014_00 | Cod sursa (job #3041181) | Cod sursa (job #1236571) | porc | Cod sursa (job #1339288)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int N, K;
int St[20];
void Afisare ()
{
int i;
for (i = 1; i <= K; i ++)
out << St[i] << " ";
out << "\n";
}
void Back (int lvl)
{
if (lvl == K + 1){
Afisare ();
return;
}
int i;
for (i = St[lvl - 1] + 1; i <= N; i ++){
St[lvl] = i;
Back (lvl + 1);
}
}
int main()
{
in >> N >> K;
Back(1);
return 0;
}