Pagini recente » Cod sursa (job #237492) | Cod sursa (job #2827554) | Cod sursa (job #3276166) | Cod sursa (job #898065) | Cod sursa (job #1452385)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,sum,v[110],aa[10],i;
bool stop = false;
void solve( int niv, int s )
{
int i;
if( niv > 6 )
return;
for( i = 1 ; i <= n && !stop ; i++ )
{
aa[ niv ] = v[ i ];
if( niv == 6 )
{
if( s + v[ i ] == sum )
stop = true;
}
else if( niv < 6 )
{
if( s + v[ i ] < sum )
solve( niv + 1 , s + v[ i ] );
}
}
if( stop )
fout<<v[ i - 1 ]<<' ';
}
int main()
{
fin>>n>>sum;
for( i = 1 ; i <= n ; ++i )
fin>>v[ i ];
sort( v + 1 , v + n + 1 );
solve( 1 , 0 );
if( !stop )
fout<<"-1";
return 0;
}