Pagini recente » Cod sursa (job #2312756) | Cod sursa (job #2287878) | Cod sursa (job #793195) | Cod sursa (job #1985393) | Cod sursa (job #2809447)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int const N = 101;
int v [N];
struct cv{
int a , b , c;
};
map <int , cv> asked;
int main()
{
int n , s;
fin >> n >> s;
for(int i = 1 ; i <= n ; ++ i)
fin >> v [i];
for(int i = 1 ; i <= n ; ++ i)
for(int j = i ; j <= n ; ++ j)
for(int k = j ; k <= n ; ++ k)
asked [s - v[i] - v[j] - v[k]] = {i , j , k};
for(int i = 1 ; i <= n ; ++ i)
for(int j = i ; j <= n ; ++ j)
for(int k = j ; k <= n ; ++ k)
if (asked.count (v[i] + v[j] + v[k])){
fout << v[i] << ' ' << v[j] << ' ' << v[k] << ' ';
cv now = asked[v[i] + v[j] + v[k]];
fout << v[now.a] << ' ' << v[now.b] << ' ' << v[now.c] << '\n';
fin.close();
fout.close();
return 0;
}
fout << "-1\n";
fin.close();
fout.close();
return 0;
}