Pagini recente » Cod sursa (job #106600) | Cod sursa (job #3255203) | Cod sursa (job #2448739) | Cod sursa (job #3168784) | Cod sursa (job #2805889)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int comb[19], n, k;
void back(int p, int k, int n)
{
if(p == k + 1)
{
for(int i = 1; i <= k; i++) fout << comb[i] << " ";
fout << "\n";
return;
}
for(int i = comb[p-1] + 1; i <= n - k + p; i++)
{
comb[p] = i;
back(p+1, k, n);
}
}
int main()
{
fin >> n >> k;
back(1, k, n);
return 0;
}