Pagini recente » Cod sursa (job #1106261) | Cod sursa (job #10558) | Cod sursa (job #2056178) | Cod sursa (job #2748087) | Cod sursa (job #2172192)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n , m , x[17] , uz[17], i;
void afisare( int n )
{
for( i = 1 ; i<=n; i++ )
g << x[i] <<" ";
g << "\n";
}
void bkt(int k)
{
for( i = x[k-1]+1 ; i <= n; i++ )
{
x[k] = i;
if( k == m)
afisare( m );
else
bkt(k+1);
}
}
int main()
{
f >> n >> m;
bkt(1);
return 0;
}