Pagini recente » Cod sursa (job #821563) | Cod sursa (job #2140455) | Cod sursa (job #2448272) | Cod sursa (job #957483) | Cod sursa (job #1744314)
#include <fstream>
#include <unordered_map>
#define NR 105
#define VAL 1000005
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct suma
{
int sum;
int a;
int b;
int c;
};
suma s[VAL];
int N, S, i, M, ans;
int v[NR], j, k;
bool ok;
unordered_map<int, int> ap;
int main()
{
fin >> N >> S;
for (i=1; i<=N; i++)
fin >> v[i];
for (i=1; i<=N; i++)
{
for (j=1; j<=N; j++)
{
for (k=1; k<=N; k++)
{
s[++M].sum=v[i]+v[j]+v[k];
ap[s[M].sum]=M;
s[M].a=v[i];
s[M].b=v[j];
s[M].c=v[k];
ans=ap[S-s[M].sum];
if (ans>0)
{
ok=true;
fout << s[M].a << " " << s[M].b << " " << s[M].c << " ";
fout << s[ans].a << " " << s[ans].b << " " << s[ans].c << '\n';
break;
}
}
if (ok==true)
break;
}
if (ok==true)
break;
}
if (ok==false)
fout << -1 << '\n';
fin.close();
fout.close();
return 0;
}