Pagini recente » Cod sursa (job #2862583) | Cod sursa (job #1006302) | ONIS 2014, Clasament Runda 1 | Cod sursa (job #1165812) | Cod sursa (job #2747014)
#include<bits/stdc++.h>
using namespace std;
struct sum{
int a1,a2,a3;
};
unordered_map<int,sum>suma;
int v[101];
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
int n,s,rez,i,j,k;
fin>>n>>s;
for(i=1;i<n;i++)
{
fin>>v[i];
}
for(i=1;i<n;i++)
{
for(j=i+1; j<n && v[i]<s; j++)
{
for(k=j+1; k<n && v[i]+v[j]<s; k++)
{
rez=v[i]+v[j]+v[k];
if(rez<s && suma.count(rez)<=0)
{
suma[rez].a1=v[i];
suma[rez].a2=v[j];
suma[rez].a3=v[k];
if(suma.count(s-rez)>0)
{
fout<<suma[rez].a1<<" "<<suma[rez].a2<<" "<<suma[rez].a3<<" "<<suma[s-rez].a1<<" "<<suma[s-rez].a2<<" "<<suma[s-rez].a3;
return 0;
fin.close();
fout.close();
}
}
}
}
}
fout<<-1;
fin.close();
fout.close();
return 0;
}