Pagini recente » Cod sursa (job #490687) | Cod sursa (job #2267378) | Cod sursa (job #2429364) | Cod sursa (job #1071533) | Cod sursa (job #932461)
Cod sursa(job #932461)
#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,w[200],l,sol,v[1000005];
bool CautaBin(int x)
{
int st=1,dr=l,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x==v[mij])return true;
else
if(x<v[mij])dr=mij-1;
else st=mij+1;
}
return false;
}
void cauta(int x)
{
int i,j,k;
for (i=1; i<=a; i++)
for (j=1; j<=a; j++)
for (k=1; k<=a; k++)
if(x==w[i]+w[j]+w[k]){g<<w[i]<<" "<<w[j]<<" "<<w[k]<<" ";return;}
}
int main()
{
f>>a>>b;
l=1;
for (i=1;i<=a;i++)f>>w[i];
for (i=1;i<=a;i++)
for (j=1;j<=a;j++)
for (k=1;k<=a;k++)
v[l++]=w[i]+w[j]+w[k];
sort(v+1,v+l+1);
for (i=1;i<=l;++i)
if(CautaBin(b-v[i])){sol=v[i];break;}
if (sol==0)g<<"-1\n";
else
{
cauta(sol);cauta(b-sol);
g<<'\n';
}
return 0;
}