Pagini recente » Cod sursa (job #2971887) | Cod sursa (job #2265588) | Cod sursa (job #1111997) | Cod sursa (job #3122935) | Cod sursa (job #2485135)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("loto.in");
ofstream out("loto.out");
int i,j,k,n,m,v[1001],a[1001],s,nn,q,o,ok,p,t,r,l,oo,ll,pp,tt,rr,qq;
int main()
{
cin>>n>>s;
for(int i=1; i<=n; i++)
{
cin>>v[i];
}
for(int q=1; q<=n; q++)
{
for(int t=1; t<=n; t++)
{
for(int o=1; o<=n; o++)
{
for(int p=1; p<=n; p++)
{
for(int l=1; l<=n; l++)
{
for(int r=1; r<=n; r++)
{
if(v[q]+v[t]+v[o]+v[p]+v[l]+v[r]==s)
{
oo=o;
pp=p;
qq=q;
tt=t;
rr=r;
ll=l;
ok=1;
}
}
}
}
}
}
}
if(ok)
for(i=1; i<=1; i++)
{
cout<<v[rr]<<" "<<v[ll]<<" "<<v[pp]<<" "<<v[oo]<<" "<<v[tt]<<" "<<v[qq];
}
else
cout<<-1;
return 0;
}