Pagini recente » Cod sursa (job #404395) | Cod sursa (job #2708370) | Cod sursa (job #1927927) | Cod sursa (job #485682) | Cod sursa (job #387642)
Cod sursa(job #387642)
#include <fstream>
using namespace std;
ifstream in ( "combinari.in" );
ofstream out ( "combinari.out" );
int n, sol [ 16 ], k;
void afisare ()
{
for ( int i = 2; i <= k + 1; ++i )
out << sol [ i ] << " ";
out << "\n";
}
bool valid ( int p )
{
for ( int i = 1; i < p; ++i )
if ( sol [ i ] == sol [ p ] )
return false;
return true;
}
void bkt ( int p )
{
if ( p == k + 1 )
{
afisare ();
return;
}
for ( int i = sol [ p ] + 1; i <= n; ++i )
{
sol [ p + 1 ] = i;
bkt ( p + 1 );
}
}
int main ()
{
in >> n >> k;
bkt ( 1 );
return 0;
}