Pagini recente » Cod sursa (job #1325926) | Cod sursa (job #26005) | Cod sursa (job #2480935) | Cod sursa (job #1468945) | Cod sursa (job #2778581)
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen ("loto.out","w",stdout);
freopen ("loto.in","r",stdin);
int n, s;
cin >> n >> s;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
map<int, bool> m;
for(int i = 0; i < n; i++) {
for(int j = i; j < n; j++) {
for(int k = j; k < n; k++) {
int sum = a[i] + a[j] + a[k];
m[sum] = 1;
if(m[s - sum]) {
for(int i2 = 0; i2 < n; i2++) {
for(int j2 = 0; j2 < n; j2++) {
for(int k2 = 0; k2 < n; k2++) {
if(a[i2] + a[j2] + a[k2] == s - sum) {
cout << a[i] << ' ' << a[j] << ' ' << a[k] << ' ';
cout << a[i2] << ' ' << a[j2] << ' ' << a[k2] << ' ';
return 0;
}
}
}
}
}
}
}
}
cout << -1;
}