Pagini recente » Cod sursa (job #753516) | Cod sursa (job #1364946) | Cod sursa (job #1617007) | Cod sursa (job #2045186) | Cod sursa (job #2743650)
#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, k;
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++)
for(k = j; k < N; k++)
m[v[i] + v[j] + v[k]] = to_stringg(v[i]) + " " + to_stringg(v[j]) + " " + to_stringg(v[k]);
unordered_map<int,string>::iterator q;
for(q = m.begin(); q != m.end(); q++)
{
dif = S - q->first;
if(m.find(dif) != m.end())
{
g << q->second << " "<< m[dif];
return 0;
}
}
g << -1;
return 0;
}