Pagini recente » Cod sursa (job #135224) | Cod sursa (job #2724099) | Cod sursa (job #2117259) | Cod sursa (job #2089813) | Cod sursa (job #2894152)
#include <fstream>
#include<unordered_map>
int main()
{
std::ifstream fileIn("loto.in");
std::ofstream fileOut("loto.out");
int v[100];
std::unordered_map<int, std::tuple<short,short,short>> multime;
short n;
int suma;
short i, j, k;
fileIn >> n >> suma;
for (i = 0; i < n ; i++) {
fileIn >>v[i];
}
for(i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++) {
if (multime.find(suma-(v[i] + v[j]+ v[k]))!= multime.end()) {
std::tuple<short,short,short> tuplu1;
tuplu1 = (*multime.find(suma-(v[i] + v[j]+ v[k]))).second;
fileOut << v[i] << ' ';
fileOut << v[j] << ' ';
fileOut << v[k] << ' ';
fileOut << v[std::get<0>(tuplu1)] << ' ';
fileOut << v[std::get<1>(tuplu1)] << ' ';
fileOut << v[std::get<2>(tuplu1)];
return 0;
}
multime.insert({v[i] + v[j]+ v[k], {i,j,k}});
}
fileOut << -1;
return 0;
}