Pagini recente » Cod sursa (job #200268) | Cod sursa (job #378464) | Cod sursa (job #1606472) | Cod sursa (job #1855840) | Cod sursa (job #2006047)
#include <fstream>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
const int NMAX = 300000005;
int v[105],n;
char ap[NMAX];
int main()
{
int n,s,i,j,k,i2,j2,k2;
in >> n >> s;
for (i = 0; i<n; i++)
in >> v[i];
for (i = 0; i<n; i++)
for (j = i; j<n; j++)
for (k = j; k<n; k++)
ap[v[i]+v[j]+v[k]] = 1;
for (i = 0; i<n; i++)
for (j = i; j<n; j++)
for (k = j; k<n; k++)
{
int dif = s-v[i]-v[j]-v[k];
if (ap[dif])
{
out << v[i] << " " << v[j] << " " << v[k] << " ";
for (i2 = 0; i2<n; i2++)
for (j2 = i2; j2<n; j2++)
for (k2 = j2; k2<n; k2++)
if (v[i2]+v[j2]+v[k2] == dif)
{
out << v[i2] << " " << v[j2] << " " << v[k2];
return 0;
}
}
}
out << "-1";
}