Pagini recente » Cod sursa (job #1621308) | Cod sursa (job #1538256) | Cod sursa (job #822389) | Cod sursa (job #3131859) | Cod sursa (job #1088424)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
int x[20];
int v[20];
void afisare ()
{
for ( int i = 1; i <= k ; i++ )
g << x[i] << " ";
g << '\n';
}
void combinari ( int b)
{
if ( b > k)
{
afisare();
return;
}
else
{
for ( int i = x[b-1]+1 ; i <= n ; i++ )
{
if ( v[i] == 0)
{
x[b] = i;
v[i] = 1;
combinari(b+1);
v[i] = 0;
}
}
}
return;
}
int main ()
{
f >> n >> k;
combinari(1);
return 0;
}