Pagini recente » Cod sursa (job #37967) | Cod sursa (job #2645151) | Cod sursa (job #1186950) | Cod sursa (job #907492) | Cod sursa (job #3193200)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, v[19];
void back(int pos)
{
int i;
if(pos == k + 1)
{
for(i = 1; i <= k; i++)
{
fout << v[i] << " ";
}
fout << "\n";
}
else
{
for(i = v[pos - 1] + 1; i <= n; i++)
{
v[pos] = i;
back(pos + 1);
}
}
}
int main()
{
fin >> n >> k;
back(1);
return 0;
}