Pagini recente » Cod sursa (job #2664685) | Cod sursa (job #2509874) | Cod sursa (job #1579715) | Cod sursa (job #75326) | Cod sursa (job #1328795)
#include <iostream>
#include <cstdio>
using namespace std;
int n , m , sol[20] ;
void back( int k ) ;
int main()
{
freopen( "combinari.in" , "r" , stdin ) ;
freopen( "combinari.out" , "w" , stdout ) ;
scanf( "%d %d" , &n , &m ) ;
back(1) ;
return 0;
}
void mue()
{
for ( int i = 1 ; i <= m ; i ++ )
printf( "%d " , sol[i] ) ;
printf( "\n" ) ;
}
void back( int k )
{
if ( k == m + 1 )
{
mue() ;
return ;
}
for ( int i = sol[k-1] + 1 ; i <= n ; i ++ )
{
sol[k] = i ;
back( k + 1 ) ;
}
}