Pagini recente » Cod sursa (job #3158260) | Cod sursa (job #2532467) | Cod sursa (job #2738967) | Cod sursa (job #3251161) | Cod sursa (job #2745637)
#include <iostream>
#include <map>
#include <vector>
#include <fstream>
using namespace std;
int main()
{
ifstream f("loto.in");
ofstream o("loto.out");
int n, s, x, sum;
map<int, vector<int> > mep;
vector<int> v;
f >> n >> s;
for(int i = 1; i <= n; i++){
f >> x;
v.push_back(x);
}
for(int i = 0; i < v.size(); i++){
for(int j = 0; j < v.size(); j++){
for(int k = 0; k < v.size(); k++){
sum = v[i] + v[j] + v[k];
mep[sum] ={v[i], v[j], v[k]};
}
}
}
for(int i = 0; i < v.size(); i++){
for(int j = 0; j < v.size(); j++){
for(int k = 0; k < v.size(); k++){
sum = v[i] + v[j] + v[k];
if(mep.find(s - sum) != mep.end()){
o << v[i] << " " << v[j] << " " << v[k] << " ";
vector<int> x = mep[s - sum];
o << x[0] << " " << x[1] << " " << x[2] << " ";
return 0;
}
}
}
}
o << -1;
return 0;
}