Pagini recente » Cod sursa (job #444401) | Cod sursa (job #1912813) | Cod sursa (job #2400875) | Cod sursa (job #2313969) | Cod sursa (job #395183)
Cod sursa(job #395183)
#include<cstdio>
int m , n ;
int st [ 25 ] ;
int marcat [ 25 ] ;
void afis ( )
{
for ( int i = 1 ; i <= n ; ++ i )
printf ( "%d " , st[i] ) ;
printf ( "\n" ) ;
}
void bkt ( int p )
{
if ( p == n + 1 )
{
afis ( );
return ;
}
int i ;
for ( i = st[p-1] + 1 ; i <= m ; ++ i )
if ( ! marcat[i] )
{
st[p]=i ;
marcat[i]=1;
bkt ( p+1);
marcat[i]=0;
}
}
int main ( )
{
freopen ( "combinari.in" , "r" , stdin ) ;
freopen ( "combinari.out" , "w" , stdout ) ;
scanf ( "%d%d" , & m , & n ) ;
bkt ( 1 ) ;
return 0 ;
}