Pagini recente » Cod sursa (job #2114544) | Cod sursa (job #1505604) | Cod sursa (job #2655825) | Cod sursa (job #1806642) | Cod sursa (job #936141)
Cod sursa(job #936141)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int a,b,i,j,k,m,n,an,bn,cn,c[103],l,sol,e[1000003],x;
bool CautaBin(int x)
{
int st=1,dr=l,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x==e[mij])return true;
else
if(x<e[mij])dr=mij-1;
else st=mij+1;
}
return false;
}
int main()
{
f>>a>>b;
for (i=1;i<=a;i++)f>>c[i];
for (i=1;i<=a;i++)
for (j=i;j<=a;j++)
for (k=j;k<=a;k++)
e[++l]=c[i]+c[j]+c[k];
sort(e+1,e+l+1);
for (i=1;i<=l;++i)
if(CautaBin(b-e[i]))
{sol=e[i];break;}
if (sol==0)g<<"-1\n";
else
{
x=sol;
for (i=1; i<=a; i++)
for (j=1; j<=a; j++)
for (k=1; k<=a; k++)
if(x==c[i]+c[j]+c[k]){g<<c[i]<<" "<<c[j]<<" "<<c[k]<<" ";i+=a;j+=a;k+=a;}
x=b-sol;
for (i=1; i<=a; i++)
for (j=1; j<=a; j++)
for (k=1; k<=a; k++)
if(x==c[i]+c[j]+c[k]){g<<c[i]<<" "<<c[j]<<" "<<c[k]<<" ";i+=a;j+=a;k+=a;}
g<<'\n';
}
return 0;
}