Pagini recente » Cod sursa (job #491497) | Cod sursa (job #1033733) | Cod sursa (job #1488430) | Cod sursa (job #3199049) | Cod sursa (job #2974789)
#include <bits/stdc++.h>
#define tii tuple<int, int, int>
#define MAX 102
using namespace std;
int n,s,v[MAX];
unordered_map<int, tii> mp;
vector<tii> sume;
ifstream fin("loto.in");
ofstream fout("loto.out");
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 = i; j <= n; j++){
for(int k = j; k <= n; k++){
sume.push_back({i, j, k});
mp[v[i]+v[j]+v[k]] = {i, j, k};
}
}
}
for(auto [x, y, z]: sume){
int rest = s-v[x]-v[y]-v[z];
if(mp.count(rest)){
auto [i, j, k] = mp[rest];
fout << v[x] << " " << v[y] << " " << v[z] << " " << v[i] << " " << v[j] << " " << v[k] << "\n";
exit(0);
}
}
fout << "-1\n";
return 0;
}