Pagini recente » Cod sursa (job #2891707) | Cod sursa (job #1355159) | Cod sursa (job #1805281) | Cod sursa (job #640568) | Cod sursa (job #3305534)
#include <bits/stdc++.h>
using namespace std;
unordered_map<int,bool>fr;
int v[105];
int main()
{
ifstream cin("loto.in");
ofstream cout("loto.out");
int n, k;
cin>>n>>k;
for(int i=1; i<=n; i++)
cin>>v[i];
for(int i=1; i<=n; i++)
{
int s=0;
for(int j=i; j<=n; j++)
for(int r=j; r<=n; r++)
s=v[i]+v[j]+v[r], fr[s]=1;
}
vector<int>rasp;
int cautam=-1, gata=0;
for(int i=1; i<=n; i++)
{
int s=0;
for(int j=i; j<=n; j++)
{
for(int r=j; r<=n; r++)
{
s=v[i]+v[j]+v[r];
if(s<=k && fr[k-s] && cautam==-1)
{
rasp.push_back(v[i]);
rasp.push_back(v[j]);
rasp.push_back(v[r]);
cautam=k-s;
}
if(s==cautam)
{
rasp.push_back(v[i]);
rasp.push_back(v[j]);
rasp.push_back(v[r]);
gata=1;
break;
}
}
if(gata)
break;
}
if(gata)
break;
}
sort(rasp.begin(), rasp.end());
if(gata)
for(auto x: rasp)
cout<<x<<" ";
else
cout<<-1;
return 0;
}