Pagini recente » Cod sursa (job #2470151) | Cod sursa (job #558832) | Cod sursa (job #352340) | Cod sursa (job #1801426) | Cod sursa (job #1810083)
#include <fstream>
using namespace std;
int m[4][52421411], n, i, j, suma, v[101], k, d, modulo = 52421411;
int main()
{
ifstream fin ("loto.in");
ofstream fout ("loto.out");
fin >> n >> suma;
for (i=1; i<=n; ++i)
fin >> v[i];
for (i=1; i<=n; ++i)
{
for (j=1; j<=n; ++j)
{
for (k=1; k<=n; ++k)
{
d = (v[i]+v[j]+v[k])%modulo;
if (m[0][d]==0)
{
m[0][d] = 1;
m[1][d] = v[i];
m[2][d] = v[j];
m[3][d] = v[k];
}
}
}
}
for (i=0; 2*i<=suma; ++i)
{
if (m[0][i%modulo] && m[0][(suma-i)%modulo])
{
fout << m[1][i] << " " << m[2][i] << " " << m[3][i] << " " << m[1][suma-i] << " " << m[2][suma-i] << " " << m[3][suma-i];
return 0;
}
}
fout << "-1";
return 0;
}