Pagini recente » Cod sursa (job #630316) | Cod sursa (job #899667) | Cod sursa (job #2922236) | Cod sursa (job #2038479) | Cod sursa (job #2809445)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int const N = 101;
int v [N];
map <int , tuple<int , int , int>> 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] << ' ';
int a , b , c;
tie(a , b , c) = asked[v [i] + v [j] + v [k]];
fout << v[a] << ' ' << v[b] << ' ' << v[c] << '\n';
fin.close();
fout.close();
return 0;
}
fout << "-1\n";
fin.close();
fout.close();
return 0;
}