Pagini recente » Cod sursa (job #316952) | Cod sursa (job #633213) | Cod sursa (job #2712307) | Cod sursa (job #456696) | Cod sursa (job #2359272)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int N, S;
int v[105];
set <int> s;
void WriteSum(int sum)
{
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
for(int k = 1; 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 = 1; j <= N; j++)
for(int k = 1; k <= N; k++)
s.insert(v[i] + v[j] + v[k]);
set <int>::iterator it = s.begin();
for(it; it != s.end(); it++)
if(s.find(S - *it) != s.end())
{
WriteSum(*it);
WriteSum(S - *it);
return 0;
}
fout << -1 << '\n';
return 0;
}