Pagini recente » Cod sursa (job #1872153) | Cod sursa (job #1090582) | Cod sursa (job #1711233) | Cod sursa (job #3161843) | Cod sursa (job #1995113)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <tuple>
using namespace std;
int main() {
int N, S;
ifstream fin("loto.in");
fin >> N >> S;
int num[N];
for(int i = 0; i < N; i++) {
fin >> num[i];
}
unordered_map<int, tuple<int,int,int>> SUM;
for(int i = 0; i < N; i++) {
for(int j = i; j < N; j++) {
for(int k = j; k < N; k++) {
SUM[num[i] + num[j] + num[k]] = make_tuple(num[i],num[j],num[k]);
// cout << num[i] << " " << num[j] << " " << num[k] << endl;
}
}
}
ofstream fout("loto.out");
for(auto p : SUM) {
if(SUM.count(S-p.first) > 0) {
fout << get<0>(p.second) << " ";
fout << get<1>(p.second) << " ";
fout << get<2>(p.second) << " ";
fout << get<0>(SUM[S-p.first]) << " ";
fout << get<1>(SUM[S-p.first]) << " ";
fout << get<2>(SUM[S-p.first]) << " ";
return 0;
}
}
fout << -1;
return 0;
}