Pagini recente » Cod sursa (job #2911858) | Cod sursa (job #1324126) | Cod sursa (job #985760) | Borderou de evaluare (job #1569008) | Cod sursa (job #2108732)
#include <iostream>
#include <fstream>
using namespace std;
int n, k, v[20], fr[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void backt(int nr)
{
if (nr==k)
{
for (int i=0; i<nr; i++)
g << v[i] <<' ';
g << endl;
return;
}
for (int i=1; i<=n-k+nr+1; i++)
{
if (fr[i]==0 && i>=v[nr-1])
{
fr[i]=1;
v[nr]=i;
backt(nr+1);
fr[i]=0;
}
}
}
int main()
{
f >> n >> k;
backt(0);
return 0;
}