Pagini recente » Cod sursa (job #1869515) | Cod sursa (job #1292888) | Cod sursa (job #3189231) | Cod sursa (job #1911716) | Cod sursa (job #2407526)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int r,n,v[104],a,s;
void cautbin(int x,int t)
{
int p=1;
int u=n;
int mid;
while(p<=u)
{
if(r==1)
break;
mid=(p+u)/2;
a=v[mid]+x;
if(t==6 && a==s)
{
r=1;
fout<<v[mid]<<" ";
return;
}
if(a<s && t<6)
{
cautbin(a,t+1);
if(r==1)
break;
p=mid+1;
}
else
u=mid-1;
}
if(r==1)
{
fout<<v[mid]<<" ";
}
}
int main()
{
fin>>n>>s;
for(int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
cautbin(0,1);
if(r==0)
fout<<-1;
return 0;
}