Pagini recente » Cod sursa (job #2390411) | Cod sursa (job #3285478) | Cod sursa (job #2624885) | Cod sursa (job #2736264) | Cod sursa (job #2896268)
#include <bits/stdc++.h>
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin ("loto.in");
ofstream fout ("loto.out");
struct X
{
int x,y,z;
friend ostream& operator<<(ostream& out,const X& a){
out<<a.x<<" "<<a.y<<" "<<a.z;
return out;
}
};
unordered_map<int, X> rez;
int main()
{ int n,s,v[104],suma,i,j,k;
fin>>n>>s;
for(i=1; i<=n; i++)
fin>>v[i];
for (i=1; i<=n; i++)
{ for(j=i; j<=n; j++)
{ for(k=j; k<=n; k++)
{ X b;
b.x=v[i];
b.y=v[j];
b.z=v[k];
suma=v[i]+v[j]+v[k];
rez[suma]=b;
if(rez.find(s-suma)!=rez.end())
{
fout<<rez[suma]<<" "<<rez[s-suma];
return 0;
}
}
}
}
fout<<-1;
return 0;
}