Pagini recente » Cod sursa (job #937247) | Cod sursa (job #835945) | Cod sursa (job #1844376) | Cod sursa (job #2057329) | Cod sursa (job #2743641)
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
#include <string>
#include <sstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int N, S, dif, a, b;
int* v;
unordered_map<int, string> m;
string to_stringg(int x)
{
stringstream ss;
ss << x;
return ss.str();
}
int main()
{
int i, x, j;
f >> N >> S;
v = new int[N];
for(i = 0; i < N; i ++)
{
f >> x;
v[i] = x;
}
for(i = 0; i < N; i++)
for(j = i; j < N; j++)
m[v[i] + v[j]] = to_stringg(v[i]) + " " + to_stringg(v[j]);
unordered_map<int,string>::iterator q, r;
for(q = m.begin(); q != m.end(); q++)
for(r = m.begin(); r != m.end(); r++)
{
dif = S - q->first - r->first;
if(m.find(dif) != m.end())
{
g << q->second << " " << r->second << " " << m[dif];
return 0;
}
}
g << -1;
return 0;
}