Pagini recente » Cod sursa (job #610636) | Cod sursa (job #1138742) | Cod sursa (job #3193333) | Cod sursa (job #1154682) | Cod sursa (job #3240380)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
struct garos
{
int s,u,d;
};
unordered_map<int,garos>umap;
int v[105];
int main()
{
int n,s;
cin>>n>>s;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
for(int k=j;k<=n;k++)
{
umap[v[i]+v[j]+v[k]].s=v[i];
umap[v[i]+v[j]+v[k]].u=v[j];
umap[v[i]+v[j]+v[k]].d=v[k];
}
}
}
int ok=0;
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
for(int k=j;k<=n;k++)
{
if(umap.count(s-(v[i]+v[j]+v[k]))>0)
{
ok=1;
cout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<umap[s-(v[i]+v[j]+v[k])].s<<" "<<umap[s-(v[i]+v[j]+v[k])].u<<" "<<umap[s-(v[i]+v[j]+v[k])].d;
return 0;
}
}
}
}
if(ok==0)
cout<<-1;
return 0;
}