Pagini recente » Cod sursa (job #2189650) | Cod sursa (job #686638) | Cod sursa (job #2367886) | Cod sursa (job #3212392) | Cod sursa (job #3166287)
#include <bits/stdc++.h>
#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
ifstream fin ("loto.in");
ofstream fout ("loto.out");
const int NMAX=1e2+5;
int v[NMAX];
struct elem{
int x;
int y;
int z;
};
map<int,elem>mp;
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
int n,s,i,j,k;
fin>>n>>s;
for(i=1;i<=n;i++)
fin>>v[i];
fin.close();
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
mp[v[i]+v[j]+v[k]]={v[i],v[j],v[k]};
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
if(mp.find(s-v[i]-v[j]-v[k])!=mp.end())
{
auto it=mp[s-v[i]-v[j]-v[k]];
fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<it.x<<" "<<it.y<<" "<<it.z;
fout.close();
exit(0);
}
}
fout<<-1;
fout.close();
return 0;
}