Pagini recente » Cod sursa (job #1146492) | Monitorul de evaluare | Cod sursa (job #1146447) | Cod sursa (job #2437521) | Cod sursa (job #2747276)
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int main(){
int n,s,x,saux;
unordered_map<int, vector<int>> sume(1000000);
vector<int> v;
in>>n>>s;
for(int i=0; i<n; i++){
in>>x;
v.push_back(x);
}
for(unsigned int j=0; j<v.size(); j++){
for(unsigned int k=j; k<v.size(); k++){
for(unsigned int l=k; l<v.size(); l++){
saux=v[j]+v[k]+v[l];
sume[saux]={v[j], v[k], v[l]};
if(sume.find(s-saux)!=sume.end()){
out<<v[j]<<" "<<v[k]<<" "<<v[l]<<" ";
out<<sume[s-saux][0]<<" "<<sume[s-saux][1]<<" "<<sume[s-saux][2];
return 0;
}
}
}
}
out<<-1;
in.close();
out.close();
return 0;
}