Pagini recente » Cod sursa (job #12555) | Cod sursa (job #1009340) | Cod sursa (job #696300) | Cod sursa (job #573636) | Cod sursa (job #2839369)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
struct sol
{
int x, y, z;
};
const int NMAX = 103, MOD = 666013;
int v[NMAX];
vector <pair <int, sol> > r[MOD + 3];
vector <pair <int, sol> > :: iterator it1, it2;
int main()
{
int n, s, i, j, k;
cin >> n >> s;
for (i = 1; i <= n; i++)
cin >> v[i];
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
for (k = 1; k <= n; k++)
{
sol aux;
aux.x = v[i];
aux.y = v[j];
aux.z = v[k];
int sum = v[i] + v[j] + v[k];
r[sum % MOD].push_back({sum, aux});
}
for (i = 0; i < MOD; i++)
for (it1 = r[i].begin(); it1 != r[i].end(); it1++)
{
int val = s - it1->first;
int rest = val % MOD;
for (it2 = r[rest].begin(); it2 != r[rest].end(); it2++)
if (val == it2->first)
{
cout << it1->second.x << " " << it1->second.y
<< " " << it1->second.z << " ";
cout << it2->second.x << " " << it2->second.y
<< " " << it2->second.z;
return 0;
}
}
cout << -1;
}