Pagini recente » Cod sursa (job #2127688) | Cod sursa (job #1334841) | Cod sursa (job #2648184) | Cod sursa (job #2124115) | Cod sursa (job #2975846)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
unordered_map<int, tuple<int, int, int>> mp;
vector<tuple<int, int, int>> sum;
int n, s, v[105];
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++) {
int suma = v[i] + v[j] + v[k];
sum.push_back({v[i], v[j], v[k]});
mp[suma] = {v[i], v[j], v[k]};
}
}
}
for(auto [x, y, z] : sum) {
int rest = s - x - y - z;
if(mp.count(rest)) {
auto [i, j, k] = mp[rest];
fout << x << " " << y << " " << z << " " << i << " " << j << " " << k;
exit(0);
}
}
fout << "-1";
return 0;
}