Pagini recente » Cod sursa (job #2449389) | Cod sursa (job #2447404) | Cod sursa (job #2712126) | Cod sursa (job #1086204) | Cod sursa (job #2895788)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
const int p = 666013;
struct triplet{
int x, y, z;
} suma[p + 2];
int main()
{
int n, i, j, k, v[101];
triplet t;
long int s, aux;
fin >> n >> s;
for(i = 0; i < n; i++)
fin >> v[i];
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++)
for(int k = j; k < n; k++)
{
t.x = v[i]; t.y = v[j]; t.z = v[k];
suma[(v[i] + v[j] + v[k]) % p] = t;
}
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++)
for(int k = j; k < n; k++)
{
aux = (s - v[i] - v[j] - v[k]) % p;
if(aux < 0)
aux += p;
if(suma[aux].x)
{
if(v[i] + v[j] + v[k] + suma[aux].x + suma[aux].y + suma[aux].z == s)
{
fout << v[i] << ' ' << v[j] << ' ' << v[k] << ' ' << suma[aux].x << ' ' << suma[aux].y << ' ' << suma[aux].z;
return 0;
}
}
}
fout << -1;
return 0;
}