Pagini recente » Cod sursa (job #2773603) | Cod sursa (job #1969850) | Cod sursa (job #927163) | Cod sursa (job #2885434) | Cod sursa (job #2625608)
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
int main()
{
int n, s;
int numere[101];
unordered_map<int, int*> sume;
ifstream in("loto.in");
ofstream out("loto.out");
in >> n >> s;
for (int i = 0; i < n; i++) {
in >> numere[i];
}
int suma_partiala, i = 0;
while(i < n) {
for (int j = i; j < n; j++) {
for (int k = j; k < n; k++) {
suma_partiala = numere[i] + numere[j] + numere[k];
if (!sume[suma_partiala])
{
int* val_curr = new int[3];
val_curr[0] = numere[i];
val_curr[1] = numere[j];
val_curr[2] = numere[k];
sume[suma_partiala] = val_curr;
}
}
}
i++;
}
if (i >= n+2) {
out << -1;
}
else
{
for (int i = 0; i < 3; i++) {
out << sume[suma_partiala][i] << " ";
}
for (int i = 0; i < 3; i++) {
out << sume[s-suma_partiala][i] << " ";
}
}
return 0;
}