Pagini recente » Cod sursa (job #1955079) | Cod sursa (job #2883089) | Cod sursa (job #2681318) | Cod sursa (job #693569) | Cod sursa (job #2101840)
#include <fstream>
using namespace std;
ifstream f( "combinari.in");
ofstream g( "combinari.out");
int n , m , x[17] , uz[17];
void afisare( int n )
{
for ( int i = 1 ; i <= n ; i ++ )
g << x[i] << " " ;
g<<'\n';
}
void bkt(int k)
{
for ( int 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;
}