Pagini recente » Cod sursa (job #3143032) | Cod sursa (job #1744651) | Cod sursa (job #1107484) | Cod sursa (job #1717486) | Cod sursa (job #2895283)
#include <iostream>
#include <unordered_map>
#include <tuple>
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
unordered_map<int, tuple<int,int,int>>M;
int n,s,v[101];
int main() {
int i,j,z,suma,dif;
f>>n>>s;
for(int i=0;i<n;i++)
{
f>>v[i];
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
for(z=0;z<n;z++)
{
suma = v[i]+v[j]+v[z];
M[suma]=make_tuple(v[i],v[j],v[z]);
}
}
}
tuple<int,int,int>T;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
for(z=0;z<n;z++)
{
dif = s-v[i]-v[j]-v[z];
if(M.find(dif) != M.end()){
T = M[dif];
g<<get<0>(T)<<" "<<get<1>(T)<<" "<<get<2>(T)<<" "<<v[i]<<" "<<v[j]<<" "<<v[z];
return 0;
}
}
}
}
g<<-1;
return 0;
}