Pagini recente » Borderou de evaluare (job #2333075) | Borderou de evaluare (job #834151) | Cod sursa (job #31410) | Borderou de evaluare (job #613060) | Cod sursa (job #3239316)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,s,aux,i,j,v[101];
unordered_map<int,int> mp;
int main()
{
mp.clear();
fin>>n>>s;
for(i=1;i<=n;i++)
fin>>v[i];
for(int i1=1;i1<=n;i1++)
for(int i2=1;i2<=n;i2++)
for(int i3=1;i3<=n;i3++)
mp[v[i1]+v[i2]+v[i3]] = i1 * 1000000 + i2 * 1000 + i3;
for(int i1=1;i1<=n;i1++)
for(int i2=1;i2<=n;i2++)
for(int i3=1;i3<=n;i3++){
aux = s - v[i1] - v[i2] - v[i3];
if(mp[aux]>1000000){
fout<<v[i1]<<' '<<v[i2]<<' '<<v[i3]<<' '<<v[mp[aux]%1000]<<' '<<v[mp[aux]/1000%1000]<<' '<<v[mp[aux]/1000000];
return 0;
}
}
fout<<-1;
return 0;
}