Pagini recente » Cod sursa (job #1807349) | Cod sursa (job #2152907) | Cod sursa (job #67689) | Cod sursa (job #772288) | Cod sursa (job #749001)
Cod sursa(job #749001)
//Include
#include <fstream>
using namespace std;
//Functii
void back(int pos);
void print(int pos);
//Variabile
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k; // Combinari de n luate cate k
int stack[19];
//Main
int main()
{
in >> n >> k;
back(1);
in.close();
out.close();
return 0;
}
void back(int pos)
{
for(stack[pos]=stack[pos-1]+1 ; stack[pos]<=n ; ++stack[pos])
if(pos == k)
print(pos);
else
back(pos+1);
}
void print(int pos)
{
for(int i=1 ; i<=pos ; ++i)
out << stack[i] << ' ';
out << '\n';
}