Pagini recente » Cod sursa (job #459605) | Cod sursa (job #1019501) | Cod sursa (job #912458) | Cod sursa (job #1810495) | Cod sursa (job #3159177)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct trei
{
int x1,x2,x3;
};
unordered_map<int,trei>H;
int nr[105],n,S;
int main()
{
int i,j,k,s,ok=0;
fin>>n>>S;
for(i=1;i<=n;i++)
fin>>nr[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
H[nr[i]+nr[j]+nr[k]].x1=nr[i];
H[nr[i]+nr[j]+nr[k]].x2=nr[j];
H[nr[i]+nr[j]+nr[k]].x3=nr[k];
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
s=S-(nr[i]+nr[j]+nr[k]);
if(H.find(s)!=H.end())
{
fout<<nr[i]<<" "<<nr[j]<<" "<<nr[k]<<" "<<H[s].x1<<" "<<H[s].x2<<" "<<H[s].x3;
return 0;
}
}
fout<<-1;
fin.close();
fout.close();
return 0;
}