Pagini recente » Cod sursa (job #1122854) | Cod sursa (job #821368) | Cod sursa (job #32790) | Cod sursa (job #210171) | Cod sursa (job #3216820)
#include <fstream>
#include <unordered_map>
using namespace std;
const int Vmax = 101;
struct triplet{
int x, y, z;
};
unordered_map<int, triplet> v;
int a[Vmax];
int main(){
int n, s;
ifstream fin("loto.in");
ofstream fout("loto.out");
fin>>n>>s;
for(int i=1;i<=n;i++){
fin>>a[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
v[a[i]+a[j]+a[k]]={a[i], a[j], a[k]};
}
}
}
int ok=1;
for(int i=1;i<=n;i++){
if(!ok)
break;
for(int j=1;j<=n;j++){
if(!ok)
break;
for(int k=1;k<=n;k++){
if(v.count(s-a[i]-a[j]-a[k])){
int el = s-a[i]-a[j]-a[k];
fout<<a[i]<<" "<<a[j]<<" "<<a[k]<<" "<<v[el].x<<" "<<v[el].y<<" "<<v[el].z;
ok=0;
break;
}
}
}
}
if(ok)
fout<<-1;
return 0;
}