Pagini recente » Monitorul de evaluare | Monitorul de evaluare | Rating JesseBep (JesseBep) | Profil pestcontrol867 | Cod sursa (job #3359296)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
int arr[105];
int32_t main()
{
int n,s;
cin>>n>>s;
for (int i=1; i<=n; i++) cin>>arr[i];
map<int,pair<int,pair<int,int> > >vf;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
for (int h=1; h<=n; h++)
{
pair<int,pair<int,int> >pr;
pr.first=arr[i];
pr.second.first=arr[j];
pr.second.second=arr[h];
vf[arr[i]+arr[j]+arr[h]]=pr;
}
}
}
bool rf=0;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
{
for (int h=1; h<=n; h++)
{
if (vf[s-arr[i]-arr[j]-arr[h]].first) {rf=1; cout<<arr[i]<<" "<<arr[j]<<" "<<arr[h]<<" "<<vf[s-arr[i]-arr[j]-arr[h]].first<<" "<<vf[s-arr[i]-arr[j]-arr[h]].second.first<<" "<<vf[s-arr[i]-arr[j]-arr[h]].second.second; break;}
}
if (rf) break;
}
if (rf) break;
}
if (rf==0) cout<<-1;
}