Pagini recente » Cod sursa (job #505457) | Cod sursa (job #1967010) | Borderou de evaluare (job #1602010) | Cod sursa (job #2641704) | Cod sursa (job #2785423)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct Triplet{int x;int y;int z;};
unordered_map<int, Triplet>fr;
int n,S,i,a[105],j,k;
int main()
{
fin>>n>>S;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(k=1;j<=n;k++)
{
fr[a[i]+a[j]+a[k]]={a[i],a[j],a[k]};
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(k=1;j<=n;k++)
{
if(fr[S-a[i]-a[j]-a[k]])
{
Triplet t=fr[S-a[i]-a[j]-a[k]];
fout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<t.x<<" "<<t.y<<" "<<t.z;
return 0;
}
}
}
}
fout<<-1;
return 0;
}