Pagini recente » Cod sursa (job #976076) | Cod sursa (job #345057) | Cod sursa (job #2813699) | Cod sursa (job #758006) | Cod sursa (job #2748091)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>
using namespace std;
struct triplet{
int unu,doi,trei;
};
ifstream f("loto.in");
ofstream g("loto.out");
unordered_map<int,triplet>suma;
vector<int> numere;
int N,S,x,rest;
int main()
{
f>>N>>S;
for (int i=0;i<N;i++){
f>>x;
numere.push_back(x);
}
for(int i=0;i<N;i++)
for(int j=i;j<N;j++)
for(int k=j;i<N;k++){
triplet curent;
curent.unu=numere[i];
curent.doi=numere[j];
curent.trei=numere[k];
suma[numere[i]+numere[j]+numere[k]]=curent;
}
for (auto i=suma.begin();i!=suma.end();i++){
rest=S-i->first;
if(suma.find(rest)!=suma.end()){
g<<i->second.unu<<" "<<i->second.doi<<" "<<i->second.trei<<" "<<suma[rest].unu<<" "<<suma[rest].doi<<" "<<suma[rest].trei;
return 0;
}
}
g<<-1;
return 0;
}