Pagini recente » Cod sursa (job #1351931) | Cod sursa (job #182316) | Cod sursa (job #1020144) | Cod sursa (job #551032) | Cod sursa (job #1906720)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n, k, x[20];
void afisare()
{
int i;
for (i=1; i<=k; i++)
g << x[i] << ' ';
g << '\n';
}
void combinari (int i)
{
int val;
for (val=x[i-1]+1; val<=n-k+1; val++)
{
x[i]=val;
if (i == k)
afisare();
else combinari(i+1);
}
}
int main()
{
f >> n >> k;
combinari(1);
}