Pagini recente » Cod sursa (job #3276383) | Cod sursa (job #706203) | Cod sursa (job #103100) | Cod sursa (job #1343017) | Cod sursa (job #2126911)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int MAX = 15;
bool Busy[MAX];
int ST[MAX];
int N,K;
void Afisare()
{
for ( int i = 1; i <= K ; ++i)
out << ST[i] <<" ";
out << endl;
}
void Back(int Top, int k)
{
if(Top == k+1)
Afisare();
else
{
for ( int i = ST[Top-1] +1 ; i <= N-k+Top ; ++i)
{
ST[Top] = i;
Back(Top+1,k);
}
}
}
int main()
{
in >> N >> K;
Back(1,K);
}