Pagini recente » Cod sursa (job #382097) | Cod sursa (job #2488217) | Cod sursa (job #1084880) | Cod sursa (job #2563417) | Cod sursa (job #2014407)
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int nr[101];
bitset <300000005> v;
int main()
{
int n,s,i,j,d,k,m,p,l;
in>>n>>s;
for(i=1;i<=n;i++)
in>>nr[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
{
v[nr[i]+nr[j]+nr[k]]=1;
}
bool ok=0;
for(i=1;i<=n&&ok==0;i++)
for(j=1;j<=n&&ok==0;j++)
for(k=1;k<=n&&ok==0;k++)
{
d=s-nr[i]-nr[j]-nr[k];
if(d<=300000005-5&&d>0)
if(v[d]==1)
{
ok=1;
out<<nr[i]<<" "<<nr[j]<<" "<<nr[k]<<" ";
for(l=1;l<=n;l++)
for(m=1;m<=n;m++)
for(p=1;p<=n;p++)
if(nr[m]+nr[p]+nr[l]==d)
{
out<<nr[m]<<" "<<nr[l]<<" "<<nr[p];
}
}
}
if(ok==0)
out<<-1;
return 0;
}