Pagini recente » Cod sursa (job #3030031) | Cod sursa (job #2587500) | Cod sursa (job #1087115) | Cod sursa (job #2570800) | Cod sursa (job #2290598)
#include <bits/stdc++.h>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n,m,a;
unsigned s,x[101];
vector<pair<unsigned,unsigned>>tri;
int main()
{
f>>n>>s;
for(int i=0;i<n;i++)
f>>x[i];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for(int k=0;k<n;k++)
tri.push_back(make_pair(x[i]+x[j]+x[k],10000*i+100*j+k));
sort(tri.begin(),tri.end());
m=n*n*n;
for(int i=0,j=m-1;i<=j;)
{
if(tri[i].first+tri[j].first==s)
{
a=tri[i].second;
for(int cnt=3;cnt;cnt--,a/=100)g<<x[a%100]<<' ';
a=tri[j].second;
for(int cnt=3;cnt;cnt--,a/=100)g<<x[a%100]<<' ';
return 0;
}
if(tri[i].first+tri[j].first<s)
i++;
else
j--;
}
g<<"-1\n";
return 0;
}