Pagini recente » Cod sursa (job #2849231) | Istoria paginii utilizator/szabotamas | Istoria paginii agm-2018/clasament | Istoria paginii runda/12345678 | Cod sursa (job #1284351)
#include<fstream>
#include<unordered_map>
using namespace std;
struct vect
{
int a,b,c;
}x;
int n,i,j,k,sum;
int v[105];
unordered_map<int,vect >mymap;
unordered_map<int,vect > :: iterator it;
ifstream f("loto.in");
ofstream g("loto.out");
int main()
{
f>>n>>sum;
for (i=1;i<=n;i++)
f>>v[i];
for (i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
x.a=v[i],x.b=v[j],x.c=v[k];
mymap.insert(make_pair(v[i]+v[j]+v[k],x));
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
int temp=sum-(v[i]+v[j]+v[k]);
it=mymap.find(temp);
if (it!=mymap.end())
{
g<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<it->second.a<<" "<<it->second.b<<" "<<it->second.c<<"\n";
return 0;
}
}
g<<"-1\n";
return 0;
}