Pagini recente » Cod sursa (job #2460221) | Cod sursa (job #2744457) | Cod sursa (job #3191265) | Cod sursa (job #258453) | Cod sursa (job #2177801)
#include <bits/stdc++.h>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
tuple< int, int, int, int > v[1000005];
int n, S, nr[105];
int p, poz;
int cautBinar( int st, int dr, int val )
{
if( st > dr )
return -1;
int mid = (st + dr)/2;
if( get<0>(v[mid]) == val )
return mid;
if( get<0>(v[mid]) < val )
return cautBinar( mid + 1, dr, val );
else
return cautBinar( st, mid - 1, val );
}
int main(){
in>>n>>S;
for( int i = 1; i <= n; i++ )
in>>nr[i];
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
for( int k = 1; k <= n; k++ )
v[++p] = make_tuple( nr[i] + nr[j] + nr[k], nr[i], nr[j], nr[k] );
for( int i = 1; i <= p; i++ )
{
poz = cautBinar( 1, p, S - get<0>(v[i]) );
if( poz != -1 )
{
out<<get<1>(v[i])<<" "<<get<2>(v[i])<<" "<<get<3>(v[i])<<" ";
out<<get<1>(v[poz])<<" "<<get<2>(v[poz])<<" "<<get<3>(v[poz]);
return 0;
}
}
out<<-1;
return 0;
}