Pagini recente » Cod sursa (job #103861) | Cod sursa (job #2624673) | Cod sursa (job #2300248) | Monitorul de evaluare | Cod sursa (job #2977391)
#include <fstream>
#include <vector>
#include <algorithm>
#define mod 999997
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct cmb{
int x, nr1, nr2, nr3;
};
int v[101];
vector <cmb> l[mod];
vector <cmb>::iterator it;
int main()
{
int n, s, i, k, j;
fin>>n>>s;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(k=1;k<=n;k++)
{
int sum=v[i]+v[j]+v[k];
int ok=0, index=sum%mod;
for(it=l[index].begin();it!=l[index].end();it++)
{
if(it->x==sum)
{
ok=1;
break;
}
}
if(ok==0)
{
l[index].push_back({sum, v[i], v[j], v[k]});
}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(k=1;k<=n;k++)
{
int sum=s-v[i]-v[j]-v[k];
int ok=0, index=sum%mod;
if(sum<0)
{
continue;
}
else
{
for(it=l[index].begin();it!=l[index].end();it++)
{
if(it->x==sum)
{
ok=1;
break;
}
}
if(ok==1)
{
fout<<it->nr1<<" "<<it->nr2<<" "<<it->nr3<<" "<<v[i]<<" "<<v[j]<<" "<<v[k]<<" ";
return 0;
}
}
}
}
}
fout<<-1;
}