Pagini recente » Cod sursa (job #1423985) | Cod sursa (job #2697019) | Borderou de evaluare (job #1567385) | Cod sursa (job #1373726) | Cod sursa (job #2746412)
#include <iostream>
using namespace std;
const int nMax = 105;
int n, s, v[nMax];
int main() {
freopen("loto.in", "r", stdin);
freopen("loto.out", "w", stdout);
// Input rapid
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i1 = 0; i1 < n; i1++) {
for (int i2 = 0; i2 < n; i2++) {
for (int i3 = 0; i3 < n; i3++) {
for (int i4 = 0; i4 < n; i4++) {
for (int i5 = 0; i5 < n; i5++) {
for (int i6 = 0; i6 < n; i6++) {
int tempS = v[i1] + v[i2] + v[i3] + v[i4] + v[i5] + v[i6];
if (s == tempS) {
cout << v[i1] << " " << v[i2] << " " << v[i3] << " " << v[i4] << " " << v[i5] << " "
<< v[i6];
return 0;
}
}
}
}
}
}
}
cout << "-1";
return 0;
}