Pagini recente » Cod sursa (job #1064173) | Cod sursa (job #3131173) | Cod sursa (job #2307878) | Cod sursa (job #2539115) | Cod sursa (job #2809451)
#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 , val , i , j , k;
fin >> n >> s;
for(i = 1 ; i <= n ; ++ i)
fin >> v [i];
for(i = 1 ; i <= n ; ++ i)
for(j = i ; j <= n ; ++ j)
for(k = j ; k <= n ; ++ k)
asked [v[i] + v[j] + v[k]] = {v[i] , v[j] , v[k]};
for(i = 1 ; i <= n ; ++ i)
for(j = i ; j <= n ; ++ j)
for(k = j ; k <= n ; ++ k){
val = s - v[i] - v[j] - v[k];
if (asked.count (val) > 0){
fout << v[i] << ' ' << v[j] << ' ' << v[k] << ' ' << asked[val].a << ' ' << asked[val].b << ' ' << asked[val].c << '\n';
exit(0);
}
}
fout << "-1\n";
fin.close();
fout.close();
return 0;
}