Pagini recente » Cod sursa (job #2125860) | Cod sursa (job #2717377) | Cod sursa (job #1111723) | Cod sursa (job #1014319) | Cod sursa (job #1048989)
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
long s,S, v[1000000];int n,i,j,k,ok;
struct nod{int a,b,c,x;};
nod v1[1000000],m;
int main()
{
f>>n>>s;
for(i=0;i<n;i++)
f>>v[i];
f.close();
for(i=0;i<n;i++)
for(j=0;j<n;j++)
for(k=0;k<n;k++)
{S=v[i]+v[j]+v[k];
if(S<=s) {
v1[S].a=v[i];v1[S].b=v[j];v1[S].c=v[k];v1[S].x=S;
if (s-S>=0)
if (v1[s-S].x)
{g<<v1[S].a<<' '<<v1[S].b<<' '<<v1[S].c<<' '<<v1[s-S].a<<' '<<v1[s-S].b<<' '<<v1[s-S].c;g.close();return 0;
}
}}
g<<"-1";g.close();
return 0;
}