Pagini recente » Cod sursa (job #1839537) | Rating Vlad Coroban (coro19) | Cod sursa (job #1205539) | Cod sursa (job #2202299) | Cod sursa (job #2359325)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int N, S;
int v[105];
unordered_set <int> s;
void WriteSum(int sum)
{
for(int i = 1; i <= N; i++)
for(int j = i; j <= N; j++)
for(int k = j; k <= N; k++)
if(v[i] + v[j] + v[k] == sum)
{
fout << v[i] << ' ' << v[j] << ' ' << v[k] << ' ';
return ;
}
}
int main()
{
fin >> N >> S;
for(int i = 1; i <= N; i++)
fin >> v[i];
for(int i = 1; i <= N; i++)
for(int j = i; j <= N; j++)
for(int k = j; k <= N; k++)
s.insert(v[i] + v[j] + v[k]);
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
for(int k = 1; k <= N; k++)
if(s.find(S - v[i] - v[j] - v[k]) != s.end())
{
fout << v[i] << ' ' << v[j] << ' ' << v[k] << ' ';
WriteSum(S - v[i] - v[j] - v[k]);
return 0;
}
fout << -1 << '\n';
return 0;
}